perm filename W85.OUT[LET,JMC] blob
sn#789531 filedate 1985-03-31 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00139 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00013 00002
C00014 00003 ∂01-Jan-85 1232 JMC solvability modulo primes
C00015 00004 ∂01-Jan-85 1359 JMC
C00016 00005 ∂01-Jan-85 1656 JMC message received
C00017 00006 ∂02-Jan-85 1433 JMC book from Stanford Bookstore
C00018 00007 ∂02-Jan-85 1440 JMC another book
C00019 00008 ∂02-Jan-85 1525 JMC
C00020 00009 ∂02-Jan-85 1542 JMC bookstore again
C00021 00010 ∂02-Jan-85 1558 JMC
C00022 00011 ∂02-Jan-85 1600 JMC
C00023 00012 ∂02-Jan-85 1613 JMC
C00024 00013 ∂02-Jan-85 1634 JMC dovering score files from sail
C00025 00014 ∂02-Jan-85 1713 JMC
C00026 00015 ∂02-Jan-85 1731 JMC
C00027 00016 ∂03-Jan-85 1132 JMC error in Karmarkar abstract
C00028 00017 ∂03-Jan-85 1428 JMC re: Right to Life in Romania (from SAIL's BBOARD)
C00029 00018 ∂03-Jan-85 1935 JMC re: fantasy in HCN
C00030 00019 ∂03-Jan-85 2124 JMC reply to message
C00031 00020 ∂03-Jan-85 2128 JMC re: TeX
C00032 00021 ∂04-Jan-85 0216 JMC re: TeX
C00033 00022 ∂04-Jan-85 0933 JMC Bellin
C00034 00023 ∂04-Jan-85 0934 JMC
C00035 00024 ∂04-Jan-85 1102 JMC vita
C00036 00025 ∂04-Jan-85 1103 JMC beginning closer working relationships
C00038 00026 ∂04-Jan-85 1544 JMC run
C00039 00027 ∂04-Jan-85 1546 JMC re: MCC Industrial Affiliates Program
C00040 00028 ∂04-Jan-85 1558 JMC PROLOG Digest V2 #37
C00042 00029 ∂04-Jan-85 1559 JMC PROLOG Digest V2 #38
C00051 00030 ∂04-Jan-85 1600 JMC PROLOG Digest V2 #39
C00069 00031 ∂04-Jan-85 1600 JMC PROLOG Digest V2 #40
C00094 00032 ∂04-Jan-85 1601 JMC PROLOG Digest V2 #40
C00119 00033 ∂05-Jan-85 1215 JMC Request for comments:
C00153 00034 ∂05-Jan-85 1359 JMC re: arpa paragraph(s)
C00154 00035 ∂05-Jan-85 1403 JMC good words for DARPA
C00155 00036 ∂05-Jan-85 1409 JMC
C00156 00037 ∂05-Jan-85 1610 JMC re: MCC University Affiliates Program
C00158 00038 ∂05-Jan-85 1620 JMC Radical computing
C00163 00039 ∂05-Jan-85 1642 JMC
C00198 00040 ∂05-Jan-85 1737 JMC
C00199 00041 ∂05-Jan-85 1821 JMC radical computing
C00200 00042 ∂05-Jan-85 2217 JMC re: Request for comments: (from SAIL's BBOARD)
C00201 00043 ∂05-Jan-85 2340 JMC symbol
C00202 00044 ∂07-Jan-85 0050 JMC re: Request for comments: (from SAIL's BBOARD)
C00206 00045 ∂07-Jan-85 1851 JMC
C00207 00046 ∂07-Jan-85 1909 JMC JOB FOR SCRIBE WIZARD
C00209 00047 ∂08-Jan-85 1651 JMC re: scribe
C00210 00048 ∂08-Jan-85 1652 JMC re: FULL FAULTY MEETING TODAY
C00211 00049 ∂08-Jan-85 2122 JMC
C00212 00050 ∂08-Jan-85 2136 JMC goetz
C00222 00051 ∂08-Jan-85 2302 JMC re: OR colloquium by Karmarkar, Jan. (yes JAN.) 11, 1985
C00224 00052 ∂09-Jan-85 0046 JMC If threatened with mugging, say
C00225 00053 ∂09-Jan-85 0121 JMC mentioning Church-Rosser
C00226 00054 ∂09-Jan-85 1801 JMC re: New Director
C00227 00055 ∂09-Jan-85 2148 JMC re: more self defense meat (from SAIL's BBOARD)
C00229 00056 ∂09-Jan-85 2307 JMC more info
C00230 00057 ∂09-Jan-85 2312 JMC
C00231 00058 ∂09-Jan-85 2322 JMC special characters
C00232 00059 ∂10-Jan-85 0041 JMC burglar traps and watch dogs
C00233 00060 ∂10-Jan-85 1736 JMC
C00234 00061 ∂10-Jan-85 1957 JMC re: MCC's University Affiliates Program
C00235 00062 ∂10-Jan-85 2001 JMC re: Supercomputing center
C00236 00063 ∂10-Jan-85 2226 JMC re: Supercomputing center
C00237 00064 ∂10-Jan-85 2228 JMC blank transparencies
C00238 00065 ∂10-Jan-85 2306 JMC
C00239 00066 ∂12-Jan-85 1835 JMC
C00240 00067 ∂12-Jan-85 2205 JMC re: Origin of the name of the days (question, not flame!) (from SAIL's BBOARD)
C00241 00068 ∂13-Jan-85 1251 JMC con
C00242 00069 ∂13-Jan-85 1531 JMC
C00244 00070 ∂13-Jan-85 1725 JMC
C00258 00071 ∂13-Jan-85 2119 JMC re: Request for comments: (Part 2) (from SAIL's BBOARD)
C00259 00072 ∂14-Jan-85 1259 JMC
C00260 00073 ∂14-Jan-85 1345 JMC AAAI sponsorship and help with conference
C00262 00074 ∂14-Jan-85 1843 JMC re: Course listing
C00263 00075 ∂14-Jan-85 1844 JMC letter
C00264 00076 ∂14-Jan-85 2149 JMC from the Britannica article Calendar
C00267 00077 ∂15-Jan-85 0001 JMC re: backtracking
C00269 00078 ∂15-Jan-85 0918 JMC
C00270 00079 ∂15-Jan-85 1207 JMC reply to message
C00271 00080 ∂15-Jan-85 1925 JMC non-monotonic bibliography
C00272 00081 ∂15-Jan-85 1928 JMC re: Bibliography and writeup on nonmonotonic reasoning
C00273 00082 ∂15-Jan-85 1929 JMC send papers
C00274 00083 ∂16-Jan-85 1757 JMC please look
C00275 00084 ∂16-Jan-85 1933 JMC re: AAAI Executive Council Minutes
C00276 00085 ∂16-Jan-85 2032 JMC new generation systems?
C00277 00086 ∂16-Jan-85 2308 JMC re: Corrections in the annotation
C00278 00087 ∂17-Jan-85 1055 JMC re: HPP Architecture Meeting, Wed. 1/23., 9 am
C00279 00088 ∂17-Jan-85 1056 JMC re: Joe Halpern
C00280 00089 ∂17-Jan-85 1059 JMC re: AAAI Executive Council Minutes
C00281 00090 ∂17-Jan-85 1103 Mailer failed mail returned
C00283 00091 ∂17-Jan-85 1108 JMC re: new generation systems?
C00284 00092 ∂17-Jan-85 1232 JMC
C00285 00093 ∂17-Jan-85 1235 JMC
C00286 00094 ∂17-Jan-85 1903 JMC
C00287 00095 ∂17-Jan-85 2345 JMC reply to message
C00288 00096 ∂18-Jan-85 1028 JMC
C00289 00097 ∂18-Jan-85 1838 JMC
C00290 00098 ∂18-Jan-85 2153 JMC
C00291 00099 ∂18-Jan-85 2320 JMC
C00335 00100 ∂19-Jan-85 0058 JMC council
C00336 00101 ∂19-Jan-85 0135 JMC
C00337 00102 ∂20-Jan-85 1518 JMC techpsych anyone?
C00358 00103 ∂20-Jan-85 1520 JMC reply to message
C00359 00104 ∂20-Jan-85 2053 JMC re: HPP visit
C00360 00105 ∂21-Jan-85 1322 JMC HPP Visit
C00362 00106 ∂21-Jan-85 1327 JMC
C00363 00107 ∂21-Jan-85 2312 JMC re: PDP6's (from SAIL's BBOARD)
C00364 00108 ∂22-Jan-85 1154 JMC Re: no mtg next Wed
C00368 00109 ∂23-Jan-85 1706 JMC re: q
C00370 00110 ∂24-Jan-85 0202 JMC
C00379 00111 ∂24-Jan-85 0203 JMC
C00380 00112 ∂24-Jan-85 0220 JMC
C00387 00113 ∂24-Jan-85 0226 JMC Fateman material
C00389 00114 ∂24-Jan-85 0346 JMC
C00390 00115 ∂24-Jan-85 1516 JMC Info on CSLI summer school
C00392 00116 ∂24-Jan-85 1518 JMC re: Info on CSLI summer school
C00393 00117 ∂24-Jan-85 1522 JMC
C00394 00118 ∂24-Jan-85 1523 JMC Bob Kahn is here
C00395 00119 ∂24-Jan-85 1703 JMC
C00397 00120 ∂24-Jan-85 1728 JMC microadjustment
C00398 00121 ∂25-Jan-85 0131 JMC
C00399 00122 ∂25-Jan-85 1323 JMC re: fantasy in HCN
C00401 00123 ∂25-Jan-85 1328 JMC reply to message
C00402 00124 ∂26-Jan-85 1157 JMC presidency
C00403 00125 ∂26-Jan-85 1157 JMC presidency
C00404 00126 ∂26-Jan-85 1306 JMC bees
C00405 00127 ∂26-Jan-85 1307 JMC re: A random question (from SAIL's BBOARD)
C00406 00128 ∂26-Jan-85 1741 JMC more bees
C00408 00129 ∂26-Jan-85 2138 JMC re: presidency
C00410 00130 ∂26-Jan-85 2149 JMC
C00411 00131 ∂27-Jan-85 1527 JMC
C00412 00132 ∂28-Jan-85 0000 JMC re: gwai-invited talk
C00413 00133 ∂28-Jan-85 1059 JMC re: CS226
C00414 00134 ∂28-Jan-85 1127 JMC
C00415 00135 ∂28-Jan-85 1136 JMC
C00416 00136 ∂28-Jan-85 1137 JMC postpone meeting
C00417 00137 ∂28-Jan-85 1601 JMC reply to message
C00418 00138 ∂29-Jan-85 1525 Mailer failed mail returned
C00419 00139 ∂29-Jan-85 1528 JMC parking
C00421 ENDMK
C⊗;
∂01-Jan-85 1232 JMC solvability modulo primes
To: CLT
Hasse-Minkowski theorem: A quadratic form in n variables is solvable
in integers iff it is solvable over the reals and is solvable over
the p-adic numbers for each p.
∂01-Jan-85 1359 JMC
To: RA
Please send Elliott Bloom at SLAC my Dyson review and a copy of Chomsky's letter.
∂01-Jan-85 1656 JMC message received
To: elliott%slacvm.bitnet@SU-FORSYTHE.ARPA
I got it at 16:29.
∂02-Jan-85 1433 JMC book from Stanford Bookstore
To: RA
Please order for me:
"LISP programming" by I. Danicic, Blackwell Scientific Publications, Ltd.
Oxford, UK. Let me know if they can't order books from England.
∂02-Jan-85 1440 JMC another book
To: RA
Bibel, W. Automated Theorem Proving, Braunschweig, Vieweg, West Germany.
∂02-Jan-85 1525 JMC
To: nilsson@SU-SCORE.ARPA
Goad,Chris (home: 857-9674) (New Mexico: 505-455-2464) (sil: 493-0145)
Silma
43B Escondido Village
∂02-Jan-85 1542 JMC bookstore again
To: RA
I have an account at the Stanford Bookstore, number 3613. The relevance
is that they sometimes require payment in advance for such orders, and
they can charge in advance.
∂02-Jan-85 1558 JMC
To: CLT, RPG
Can we move Sequent to 3:30? I have the CSLI group on Common Sense
till then. Otherwise, I'll be late.
∂02-Jan-85 1600 JMC
To: RA
You can find that message in f84.out[let,jmc]. Do a search on the word
industry or the word industrial.
∂02-Jan-85 1613 JMC
To: RA
clark.re1 should be decorated. It replies to a letter in my out box.
∂02-Jan-85 1634 JMC dovering score files from sail
To: ME@SU-AI.ARPA, bosack@SU-SCORE.ARPA
Many departmental files are kept on Score. It would be nice
to be able to type
dover score:<nilsson>nonmon.press
from sail instead of having to log in on score.
∂02-Jan-85 1713 JMC
To: les-here
Encore Gordon Bell, 617 237-1022, Pittsburgh, (412)361 8600
15 Walnut ST. Wellesley Hills 02181
∂02-Jan-85 1731 JMC
To: aaai@SUMEX-AIM.ARPA
I don't think we should rebate to individuals in the future.
∂03-Jan-85 1132 JMC error in Karmarkar abstract
To: cottle@SU-SIERRA.ARPA
The abstract of the Karmarkar talk seems wrong. "... the radius of the
smallest sphere with center a' contained in P' ..." seems undefined. Why
can't that sphere be made as small as one likes? Can you correct the
abstract or am I confused?
∂03-Jan-85 1428 JMC re: Right to Life in Romania (from SAIL's BBOARD)
To: OTHER-SU-BBOARDS@SU-AI.ARPA
jmc - This isn't communism; it's more a red herring.
∂03-Jan-85 1935 JMC re: fantasy in HCN
To: CS.RICH@UTEXAS-20.ARPA
[In reply to message sent Thu 3 Jan 85 20:24:40-CST.]
I await the mail.
∂03-Jan-85 2124 JMC reply to message
To: GLB
[In reply to message rcvd 03-Jan-85 21:23-PT.]
Thanks.
∂03-Jan-85 2128 JMC re: TeX
To: SMC
[In reply to message rcvd 03-Jan-85 21:25-PT.]
After you TEX the file you get a line with dvidov as the command.
replace dvidov by dvidd and execute the command. That's how I
remember it anyway.
∂04-Jan-85 0216 JMC re: TeX
To: SMC
[In reply to message rcvd 04-Jan-85 02:12-PT.]
Please put it in w85,jmc.
∂04-Jan-85 0933 JMC Bellin
To: sharon@SU-SCORE.ARPA
What Bellin said is correct, and this was arranged with Stuart at the
beginning of Fall Quarter. I plan to continue to support him till June
anyway, and that will be as a Research Assistant.
∂04-Jan-85 0934 JMC
To: sharon@SU-SCORE.ARPA
P.S. His first name is Gianluigi.
∂04-Jan-85 1102 JMC vita
To: RPG
I need a vita in order to propose you for consulting professorship.
∂04-Jan-85 1103 JMC beginning closer working relationships
To: CLT
∂04-Jan-85 0910 FEIGENBAUM@SUMEX-AIM.ARPA beginning closer working relationships
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 4 Jan 85 09:10:11 PST
Date: Fri 4 Jan 85 09:11:35-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: beginning closer working relationships
To: jmc@SU-AI.ARPA
cc: nii@SUMEX-AIM.ARPA, delagi@SUMEX-AIM.ARPA, brown@SUMEX-AIM.ARPA,
rpg@SU-AI.ARPA, davies@SUMEX-AIM.ARPA, rindfleisch@SUMEX-AIM.ARPA
John
from our conversations at lunch yesteday, it seems like the time is rapidly
approaching when we should integrate out parallel-LISP activities more
closely. For us, a parallel-implementation of QLAMBDA is the base-level
on which we intend to erect our experiments concerning higher-level
architectures for a highly-parallel AI machine (simulated machine, not
hardware).Such a QLAMBDA is what you're intending to do! So we need
to work together.
Our group meets at Wednesday 9:00 to 10:30. Can you make it to one of our
meetings soon (hopefully on a Wednesday that Dick Gabriel can be there
too)?
We would warmly welcome the closer collaboration.
Ed
-------
∂04-Jan-85 1544 JMC run
To: elliott%slacvm.bitnet@SU-FORSYTHE.ARPA
ok
∂04-Jan-85 1546 JMC re: MCC Industrial Affiliates Program
To: EENGELMORE@SUMEX-AIM.ARPA
[In reply to message sent Fri 4 Jan 85 14:39:59-PST.]
I support Ed's proposal; I have just begun to do some consulting for MCC.
∂04-Jan-85 1558 JMC PROLOG Digest V2 #37
To: KUO
∂20-Nov-84 0225 RESTIVO@SU-SCORE.ARPA PROLOG Digest V2 #37
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Nov 84 02:25:07 PST
Date: Monday, November 19, 1984 8:15PM
From: Chuck Restivo (The Moderator) <PROLOG-REQUEST@SU-SCORE.ARPA>
Reply-to: PROLOG@SU-SCORE.ARPA
US-Mail: P.O. Box 4584 Stanford University, Stanford CA 94305
Phone: (415) 326-5550
Subject: PROLOG Digest V2 #37
To: PROLOG@SU-SCORE.ARPA
PROLOG Digest Tuesday, 20 Nov 1984 Volume 2 : Issue 37
Today's Topics:
Puzzle - Misprint
----------------------------------------------------------------------
Date: Mon 19 Nov 84 09:51:53-PST
From: Chuck Restivo <Restivo@SU-SCORE.ARPA>
Subject: Misprint correction (C.Morgan Problem)
[cwr] My apology for the misprint in the C.Morgan problem reprinted
from
the Automated Reasoning Journal in the Prolog Digest V2 #36.
1 and 3 should be as follows:
1.] P(i(x,i(y,x)))
3.] P(i(i(n(x),n(y)),i(y,x)))
------------------------------
End of PROLOG Digest
********************
∂04-Jan-85 1559 JMC PROLOG Digest V2 #38
To: KUO
∂29-Nov-84 0239 RESTIVO@SU-SCORE.ARPA OLOG Digest V2 #38
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 29 Nov 84 02:39:15 PST
Date: Wednesday, November 28, 1984 9:21AM
From: Chuck Restivo (The Moderator) <PROLOG-REQUEST@SU-SCORE.ARPA>
Reply-to: PROLOG@SU-SCORE.ARPA
US-Mail: P.O. Box 4584 Stanford University, Stanford CA 94305
Phone: (415) 326-5550
Subject: PROLOG Digest V2 #38
To: PROLOG@SU-SCORE.ARPA
PROLOG Digest Thursday, 29 Nov 1984 Volume 2 : Issue 38
Today's Topics:
Query - Occur Check & Tarski,
Puzzles - Integers,
LP Library - Book
----------------------------------------------------------------------
Date: 25 Nov 84 16:24:50 PST (Sun)
From: Sanjai Narain <Narain@Rand-Unix>
Subject: Occur Check
I am doing a project on rewrite rules and am running into the
problem that unification (without the occur check) leads to
the creation of infinite terms. For example, f(X,X) unifies
with f(g(U),U) and yields X = g(g(g(g(.....
Is there a simple way to check if a unification has led to
such infinite terms?
In other words can we define a predicate 'infinite←term(X)'
so it could be used to cause failure when infinite terms
are generated, E.g.
A=B, not(infinite←term(A)).
I would be very grateful for an answer.
-- Sanjai Narain
------------------------------
Date: 21 November 1984 20:21-EST
From: William G. Dubuque <WGD @ MIT-MC>
Subject: Tarski's High-School Algebra Problem
Do you happen to have references to Wilkie's and Gurevic's
work on "Tarski's High-School Algebra Problem"? I would
suspect that one would be able to construct models in the
manner that Winkler has done for disproving conjectures in
other equational varieties. I would be most interested in
any other references you might have in this area.
(P.S. I am a member of the Macsyma group which explains
my interest.)
------------------------------
Date: Mon, 19 Nov 84 20:52 EST
From: Tim Finin <Tim%UPenn.CSNet@CSNet-Relay>
Subject: Integers Problem
Will Dowling of Drexel University sent me the follwing
problem which he thought would be appropriate for encoding
(and solving!).
There are 2 integers n1 and n2 between 3 and 98 inclusive.
Person S has been told their sum and person P their product.
The following truthful conversation occurs:
P: I don't know n1 and n2.
S: I knew you didn't. Neither do I.
P: Now I know them!
S: Now I do, too!!
What are the values of n1 and n2?
Will sent me his own formalization in logic. In the interest
of not spoiling anyone's fun, I'll delay posting (for a week
or so) his formalization and my own attempt to encode this
problem.
-- Tim
------------------------------
Date: Wed, 21 Nov 84 13:03:28 EST
Subject: Foundations of Logic Programming
Foundations of Logic Programming
J.W. Lloyd
Springer-Verlag,ISBN 3-540-13299-6
This is the first book to give an account of the mathematical
foundations of Logic Programming. Its purpose is to collect,
in a unified and comprehensive manner, the basic theoretical
results of Logic Programming, which have previously only been
available in widely scattered research papers.
The book is intended to be self-contained, the only prerequisites
being some familiarity with Prolog and knowledge of some basic
undergraduate mathematics.
As well as presenting the technical results, the book also
contains manyillustrative examples and a list of problems
at the end of each chapter. Many of the examples and problems
are part of the folklore of Logic Programming and are not easily
obtainable elsewhere.
CONTENTS
Chapter 1. DECLARATIVE SEMANTICS
section 1. Introduction
section 2. Logic programs
section 3. Models of logic programs
section 4. Answer substitutions
section 5. Fixpoints
section 6. Least Herbrand model
Problems for chapter 1
Chapter 2. PROCEDURAL SEMANTICS
section 7. Soundness of SLD-resolution
section 8. Completeness of SLD-resolution
section 9. Independence of the computation rule
section 10. SLD-refutation procedures
section 11. Cuts
Problems for chapter 2
Chapter 3. NEGATION
section 12. Negative information
section 13. Finite failure
section 14. Programming with the completion
section 15. Soundness of the negation as failure rule
section 16. Completeness of the negation as failure rule
Problems for chapter 3
Chapter 4. PERPETUAL PROCESSES
section 17. Complete Herbrand interpretations
section 18. Properties of T'
section 19. Semantics of perpetual processes
Problems for chapter 4
------------------------------
End of PROLOG Digest
********************
∂04-Jan-85 1600 JMC PROLOG Digest V2 #39
To: KUO
∂14-Dec-84 0238 RESTIVO@SU-SCORE.ARPA ROLOG Digest V2 #39
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Dec 84 02:37:46 PST
Date: Thursday, December 13, 1984 9:30AM
From: Chuck Restivo (The Moderator) <PROLOG-REQUEST@SU-SCORE.ARPA>
Reply-to: PROLOG@SU-SCORE.ARPA
US-Mail: P.O. Box 4584 Stanford University, Stanford CA 94305
Phone: (415) 326-5550
Subject: PROLOG Digest V2 #39
To: PROLOG@SU-SCORE.ARPA
PROLOG Digest Friday, 14 Dec 1984 Volume 2 : Issue 39
Today's Topics:
Implementations - UNSW Availability,
Query - Burroughs Snag,
Programming - Infinite Terms,
Puzzle - Integer Solution
----------------------------------------------------------------------
Date: Mon 26 Nov 84 23:35:08-PST
From: Michael A. Haberler <HABERLER@SU-SIERRA.ARPA>
Subject: UNSW Prolog for MS-DOS
I have ported the University of New South Wales Prolog
interpreter to an IBM PC running MS-DOS 2.0. It implements
all built-in predicates of the Unix version and can call
your favorite editor or the command line interpreter.
UNSW Prolog is closely patterned after Prolog-10, but has
no compiler.
I got the permission to redistribute the interpreter from
the author of the Unix version, Claude Sammut of UNSW. If
you want to obtain a copy, sign the license which can be FTP'ed
from [SCORE]:<Prolog>UNSW←PROLOG.LICENSE, and send the
license with 2 DSDD diskettes to the adress below. Neither
Claude nor me charge anything for it.
-- Michael Haberler
Computer Systems Laboratory ERL 403
Stanford University, Stanford CA 94305
(415)497-9503
------------------------------
Date: Mon, 04 DEC 84 19:42:00 EDT
From: h156004%njecnvm.bitnet@WISCVM.ARPA
Has anyone brought up YORK Prolog on a Burroughs 1955? We have
the latest version written in ISO Pascal; unfortunately the
Burroughs Pascal is a version of UCSD. Therefore:
(1) Dispose is not implemented
(2) Non-local GOTO's are not implemented
(3) A file may not be a component of any
structured type
Number's 1 & 2 are causing us considerable problems; we're down
to 12 compiling errors.
If anyone has compiled this implementation or has a DISPOSE
and GOTO routine written, we'd sure like to have them. We
wouldn't go to all of this difficulty if Burroughs had a
Prolog.
-- Ken Tompkins
------------------------------
Date: Thu 29 Nov 84 19:14:35-PST
From: Joseph A. Goguen <Goguen@SRI-AI.ARPA>
Subject: References on Narrowing on Logic Programming
I would like to add two references to those mentioned by
Uday Reddy. These papers describe Eqlog, a language that
supports both predicate and functional programming, as well
as the "join" of the two via narrowing, thus allowing logical
variables in equations. (As the titles suggest, there is
more to the languge than that.)
Goguen, J. and Meseguer, J. "Equality, Types, Modules and
(Why Not?) Generics for Logic Programming, J. Logic
Programming, vol. 2, pp.179-210, 1984.
Goguen, J. and Meseguer, J. "Equality, Types, Modules and
Generics for Logic Programming, in Proceedings, Second
International Logic Programming Conference (Uppsala, Sweden),
pp.115-126, 1984.
The key idea is to use Horn clause logic *with* equality as
the logical basis, rewrite rules for the equational part, the
usual Prolog unification for the predicate part, and (the new
idea) narrowing for solving equations with logical variables.
------------------------------
Date: Mon, 10 Dec 84 09:44:09 pst
From: Michel Boyer <Boyer%iro.udem.cdn%ubc.csnet@CSNet-Relay>
Subject: Infinite Terms
In the 29 Nov issue of the Digest, Sanjai Narain asked if
there is a way to define a Prolog predicate infinite←term
that would check if a term is infinite. Here is a solution
that assumes that the interpreter can unify such terms (the
only interpreter I have access to and that does the job
correctly is Marseilles's Prolog 2).
Given a term X, let's say that Y is a sub-term of X if Y is
a branch of X (one of its arguments) or any sub-term of such
a branch. It is known [1] that any term that Prolog can build,
finite or infinite, has only a finite set of sub-terms. A term
is infinite if and only if there is a loop in its tree-ish
representation i.e. if there is a sub-term that is a sub-term
of itself.
The idea of the following program is simply to keep a list of
all the sub-terms seen above the present position in a depth
first search of a repeating subtree. Each time we go "deeper"
in the term, we add the current term to this list if it is
not already there. We know the tree is infinite if the current
term is already in the list.
infinite(Tree) :- duplicate←in←tree(Tree, []).
duplicate←in←tree(Tree, Trees←above) :-
nonvar(Tree),
member(Tree, Trees←above), ! .
duplicate←in←tree(Tree, Trees←above) :-
nonvar(Tree),
Tree =.. [Root | Branches],
duplicate←in←branches(Branches, [Tree | Trees←above]).
duplicate←in←branches([First | Others], Trees←above ) :-
duplicate←in←tree(First, Trees←above), ! .
duplicate←in←branches([First | Others], Trees←above) :-
duplicate←in←branches(Others, Trees←above).
member(X, Y) :- nonvar(Y), Y = [A | B], X == A, ! .
member(X, Y) :- nonvar(Y), Y = [A | B], member(X, B).
In the Prolog 2 version of this program, the following
questions succeed nicely:
?- X = ff(X), Y = new←root(X), infinite(Y).
?- X = ff(arg1,gg(X)), Y = gg(X), infinite(Y).
Bibliography:
[1] Colmerauer A., Prolog and Infinite Trees, in Logic Programming
(Clark K.L. and Tarnlund S.-A. editors), Academic Press, 1982,
pp 231-251.
-- Michel Boyer
------------------------------
Date: Monday, 3-Dec-84 0:38:51-GMT
From: O'Keefe HPS (on ERCC DEC-10)
Subject: Detecting Infinite terms.
This is a hardy Prolog perennial; it's about the 6th
independent invention of the idea I've seen. Doing
the unification first, and then checking to see if
you have an infinite term, would indeed restore
soundness, however it is very easy to invent examples
where one infinite term is unified with another DURING
the original A=B unification. So you still lose on
termination.
I believe it to be impossible to write a predicate in
Prolog which rejects all and only infinite terms. The
reason is that to whatever finite depth you explore, there
is always at least one proper term which looks the same.
A maximum function depth check will catch infinite terms,
but will also reject infinitely many proper terms. On
the other hand, it might be a good idea anyway. There is
a predicate in the library for checking whether a term
satisfies a function depth bound, and it won't look any
deeper than that.
You could write an infinite-term checker in your implementation
language, whatever that is, but then you might as well do
proper unification. I've been saying for a while that a real
unify/2 should be provided in every Prolog, and as an interim
measure I sent one to the library, see METUTL.PL.
PS: I've seen a draft of John Lloyd's book, and I am
definitely going to buy it!
------------------------------
Date: Wed, 12 Dec 84 11:09:11 est
From: John McLean <mclean@nrl-css>
Subject: Correction to Integer Puzzle Solution
In my last message I said that 39 is a sum that satisfies
axioms (1) and (2) of the integer puzzle. My mistake!
39 fails to satisfy axiom (2). I found this out when I ran
a Prolog program to verify my analytically derived hypothesis.
Machine wins over man again I'm afraid. In any event, the
solution generated by my fast Prolog program is not refuted by
this new information and remains unique.
-- John
------------------------------
Date: Tue, 11 Dec 84 12:53:32 est
From: John McLean <mclean@nrl-css>
Subject: Integer Puzzle
Tim Finin sent in the following puzzle:
Find 2 integers n1 and n2 between 3 and 98 inclusive.
Person S has been told their sum and person P their product.
The following truthful conversation occurs:
P: I don't know n1 and n2.
S: I knew you didn't. Neither do I.
P: Now I know them!
S: Now I do, too!!
This information can be represented as four axioms where
(X,Y) is the solution-pair (X and Y not necessarily distinct),
all variables range between 3 and 98, and E denotes existential
quantification:
1. (EA,B distinct from X,Y)A+B=X+Y
[call this axiom onesat(X,Y)]
2. (C,D)(C+D=X+Y -> (EF,G distinct from C,D)F*G=C*D)
[call this axiom twosat(X,Y)]
3. (H,I distinct from X,Y)(H*I=X*Y -> -(onesat(H,I) & twosat
(H,I)))
[call this axiom threesat(X,Y)]
4. (J,K distinct from X,Y)(J+K=X+Y -> -threesat(J,K)).
(1) is the second half of Sum's first assertion. (2) is the
first half of this assertion (which implies Product's first
assertion.) (3) and (4) are Product's second assertion and
Sum's second assertion, respectively.
This axiomatization leads to the following straight-forward
but inefficient Prolog program:
pos(3).
:
:
pos(98).
sol(X,Y) :- pos(X), pos(Y), onesat(X,Y), twosat(X,Y), threesat(X,Y),
foursat(X,Y).
onesat(X,Y) :- pos(A), pos(B), ne(A,X), ne(A,Y), E is X+Y, E is A+B.
twosat(X,Y) :- unique(X,Y), !, fail.
twosat(X,Y).
unique(X,Y) :- pos(A), pos(B), E is X+Y, E is A+B, naltmult(A,B).
naltmult(A,B) :- altmult(A,B), !, fail.
naltmult(A,B).
altmult(A,B) :- pos(C), pos(D), ne(C,A), ne(C,B), E is A*B, E is C*D.
threesat(X,Y) :- altmultsol(X,Y), !, fail.
threesat(X,Y).
ltmultsol(X,Y) :- pos(A), pos(B), ne(A,X), ne(A,Y), E is X*Y,
E is A*B, onesat(A,B), twosat(A,B).
foursat(X,Y) :- altaddsol(X,Y), !, fail.
foursat(X,Y).
altaddsol(X,Y) :- pos(A), pos(B), ne(A,X), ne(A,Y), E is X+Y,
E is A+B, threesat(A,B).
ne(X,Y) :- X=Y, !, fail.
ne(X,Y).
Efficiency can be obtained by ordering the search, placing
bounds on variables, and most importantly, realizing that there
are only 11 possible sums that X+Y can be equal to and still
satisfy both axioms (1) and (2). The following program produced
an answer on our system in 11 seconds CPU time and checked the
whole solution space in about 3 minutes, establishing uniqueness:
goodsum(13).
goodsum(19).
goodsum(25).
goodsum(29).
goodsum(31).
goodsum(37).
goodsum(39).
goodsum(43).
goodsum(49).
goodsum(53).
goodsum(55).
pos(3).
:
:
pos(52).
sol(X,Y) :- pos(X), le(Y,X), onetwosat(X,Y), threesat(X,Y),
foursat(X,Y).
onetwosat(X,Y) :- E is X+Y, goodsum(E).
threesat(X,Y) :- altmultsol(X,Y), !, fail.
threesat(X,Y).
tmultsol(X,Y) :- E is X*Y, P is E//3, min(M,P,52), !, le(A,M),
ne(A,X), ne(A,Y), B is E/A, pos(B), onetwosat(A,B).
foursat(X,Y) :- altaddsol(X,Y), !, fail.
foursat(X,Y).
altaddsol(X,Y) :- E is X+Y, M is E-3,!, le(A,M), ne(A,X),
ne(A,Y), B is E-A, pos(B), threesat(A,B).
ne(X,Y) :- X=Y, !, fail.
ne(X,Y).
le(X,Y) :- Y < 3, !, fail.
le(X,X).
le(X,Y) :- Z is Y-1, le(X,Z).
min(X,X,Y) :- X =< Y.
min(Y,X,Y) :- X > Y.
------------------------------
End of PROLOG Digest
********************
∂04-Jan-85 1600 JMC PROLOG Digest V2 #40
To: KUO
∂17-Dec-84 0238 RESTIVO@SU-SCORE.ARPA ROLOG Digest V2 #40
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 Dec 84 02:38:46 PST
Date: Sunday, December 16, 1984 12:22PM
From: Chuck Restivo (The Moderator) <PROLOG-REQUEST@SU-SCORE.ARPA>
Reply-to: PROLOG@SU-SCORE.ARPA
US-Mail: P.O. Box 4584 Stanford University, Stanford CA 94305
Phone: (415) 326-5550
Subject: PROLOG Digest V2 #40
To: PROLOG@SU-SCORE.ARPA
PROLOG Digest Monday, 17 Dec 1984 Volume 2 : Issue 40
Today's Topics:
Programming - Infinite Terms,
Puzzles - Integers
----------------------------------------------------------------------
Date: 15 Dec 84 17:28:13 PST (Sat)
From: Sanjai Narain <Narain@Rand-Unix>
Subject: Infinite terms
I think Michel Boyer's definition of 'infinite(A)', for
detecting whether the term A is infinite, is quite sound.
So, in Prologs in which A=B always terminates with success
or failure, we should be able to use the following definition
of full unification:
unify(A,B):-A=B,not(infinite(A)).
However, in Prologs which do not unify infinite terms, A=B
can indeed be non-terminating, as Richard points out, even
when A and B are finite, E.g:
f(X,X,X)=f(Y,[1,1|Y],[1,1,1|Y]).
-- Sanjai Narain
------------------------------
Date: Fri 14 Dec 84 17:34:38-MST
From: Uday Reddy <U-Reddy@UTAH-20.ARPA>
Subject: Narrowing
Thanks to Joe Goguen for mentioning Eqlog. Even though
Eqlog is an application of narrowing, the reason I did
not mention it originally was that it uses narrowing in
a slightly different way from what I suggested. Strictly
speaking, it uses not narrowing but universal unification
as the operational semantics, though narrowing is an
integral part of universal unification.
The technical difference between the two approaches is that
if narrowing is used as the operational semantics in its own
right, Eqlog's restriction that "rewrite rules should be
terminating" is not necessary. This is a significant
restriction, particularly when nonterminating rewrite rules
are considered "useful" under lazy evaluation. Secondly,
this also eliminates the need to have a separate logic part
and an equational part in a language, because general narrowing
subsumes both resolution and rewriting.
-- Uday Reddy
------------------------------
Date: Fri 14 Dec 84 12:27:59-PST
From: Allen Van Gelder <VanGelder@SU-SCORE.ARPA>
Subject: Enumerating a Range of Integers
In the recent discussion of the puzzle concerning integers
in the range 3..98, at least one solution involved axioms
pos(3) ... pos(98). This allows pos(X) to succeed 96 times
with bindings 3, 4, ... , 98. A more flexible and elegant
way to do this is given below. For this program,
?- btwn(3, 98, X).
succeeds 96 times with X bound successively to 3, 4, ... , 98
thus simulating the 96 axioms. A little study shows that besides
integers, you can enumerate any subrange of a set that has an order
relation and a successor function. (However, if this set is finite,
make sure the successor returns some dummy element outside the set
when applied to the max element IN the set.)
:- mode btwn(+, +, -).
:- mode enumlist(+, +, -).
:- mode getelt(+, -).
btwn(M, N, I) :-
enumlist(M, N, L),
getelt(L, I).
enumlist(M, N, []) :- M is N+1.
enumlist(M, N, [M | L]) :-
N >= M,
M1 is M+1,
!,
enumlist(M1, N, L).
getelt([I | ←], I).
getelt([← | L], I) :- getelt(L, I).
------------------------------
Date: 14 Dec 1984 0627-CST
From: Bruce Anderson <Anderson%TI-CSL.CSNet@CSNet-Relay>
Subject: Integers Problem
I have attached my solution to a variant of the Integers Problem
posed by Tim Finin in Vol. 2, Issue 38 of the Digest (November
29,1984). The variant appeared in "W-JS: A Modal Logic of
Knowledge" by Ma Xiwen and Guo Weide, Computer Science Institute,
Peking University, Beijing.
/*
A Prolog Solution to the S and P Puzzle
by Bruce M. Anderson (Anderson@TI-CSL)
November 8, 1984
The S and P puzzle is an example of a problem whose solution is
gradually constrained by dialog between individuals, interpreted
within the context of the individuals' point of view. Following this
brief introduction is a statement of the puzzle, a description of the
reasoning steps that lead to a solution, and the Prolog statements
for generating a solution.
To generate a solution to the S and P puzzle on the DEC-2060,
perform the following steps:
o Execute PROLOG.
o Consult this file.
o Enter "the←solution." when prompted.
For a look at the progression of solution sets as the problem
becomes increasingly constrained, enter: "the←set←F(X).",
"the←set←G(X).","the←set←H(X).", "the←set←I(X).". These responses
may be entered in any order.
The S and P puzzle was solved previously by Jeff Eisen in
Zetalisp on the Lisp Machine. The author is grateful to Jeff
for insightful discussions of the reasoning process needed to
solve this problem.
Mr. S and Mr. P Puzzle
Two numbers m and n are chosen such that 1 < m =< n < 100.
Mr. S is told their sum, and Mr. P is told their product.
The following dialog between Mr. S and Mr. P ensues:
Mr. S: I know you don't know the numbers. I don't know them
either.
Mr. P: Now I know the numbers.
Mr. S: Now I know them too.
In view of the above dialogue, what are the numbers?
The Reasoning Steps
Mr. S:
S11: I know the sum S.
S12: I know you don't know the numbers.
S13: I don't know them either.
Statement S12 implies that the product P = i * j, for all i
and j, constrained by 1 < i =< S/2 and j = S - i, cannot
be uniquely factored. P is uniquely factorable if there is
only one way that P can be written as the product of
two integers i and j, where 1 < i =< j < 100. Statement
S13 implies 6 =< S =< 196.
Define the set F to be those numbers between 6 and 196 that
as sums have constituents that in every case form products
that cannot be uniquely factored. That is,
F = { x | 6 =< x =< 196 AND x = i + j, 1 < i =< x/2, j = x - i
AND y = i * j AND y cannot be uniquely factored }
The sum S must be an element of the set F.
Mr. P:
P11: I know the product P.
P12: Now I know the numbers.
Statement S12 implies that P cannot be uniquely factored.
Mr. P can verify this by inspecting P as Statement P11
indicates. Moreover, at least one pair of factors of P
must form a sum that belongs to the set F. Define the
set G to be those products having factors that sum to
elements in the set F.
G = { z | z = i * j AND i + j belongs to F }
The product P must be an element of the set G.
Statement P12 implies that only one of the factorings of P
can be written as a sum belonging to the set F. A subset
of G consists of those elements for which there exists a
unique factoring that can be written as a sum belonging to F;
let the set H consist of those unique factor pairs.
H = { [i,j] | w = i * j AND i + j belongs to F AND
there exists no p not equal to i,
q not equal to j such that
w = p * q AND p + q belongs to F }
P is the product formed from one of the factor pairs in H;
that pair is the sought-after [m,n].
Mr. S:
S21: Now I know them too.
Statement S21 implies the existence of a unique factor pair in
H that forms the sum S. Let the set I be those pairs in H that
uniquely sum to an element of F; that is,
I = { [i,j] | [i,j] belongs to H AND
there exists no [p,q] in H, p not equal to i,
q not equal to j for which i + j = p + q }
The pair [m,n] must be the single element in I.
*/
/* Upper limit on values of the integers forming the sum and
product */
constant(number←limit,100).
/* Return a list of elements in the set F -- if the set doesn't
exist, create it and return it. */
the←set←F(List) :- the←set(f,List), !.
the←set←F(List) :- define←F, the←set(f,List).
/* Define the set F by establishing the upper limit on the sum,
creating the set, and asserting it into the global database. */
define←F :- constant(number←limit,U), N is 2 * U - 4,
build←sums(6,N,F), assertz(the←set(f,F)).
/* Create a list of sums that qualify for inclusion in the set F
by having no constituents that form a uniquely factorable
product.
For each candidate sum, the constituents are generated, then
tested to see that none can be uniquely factored. */
build←sums(I,N,[]) :- I > N, !.
build←sums(I,N,[I|T]) :-
candidate←sums(I,X), no←unique←factorization(X), !,
J is I + 1, build←sums(J,N,T).
build←sums(I,N,T) :- J is I + 1, build←sums(J,N,T).
/* Generate a list of the unique pairs of numbers, greater
than one, that sum to a given positive integer N. */
candidate←sums(N,List) :- sum←generator(2,N,List).
sum←generator(I,N,[]) :- M is 2 * I, M > N, !.
sum←generator(I,N,[[I,J]|T]) :-
J is N - I, K is I + 1, sum←generator(K,N,T).
/* A predicate that succeeds if none of the products formed from
the pairs of integers in the given list can be factored into
only one pair of integers, each with magnitude less than the
number limit (100). */
no←unique←factorization([]) :- !.
no←unique←factorization([[I,J]|T]) :-
K is I * J, factorizations(K,F), range←limits(F,G),
length(G,L), ((L =< 1, !, fail); no←unique←factorization(T)).
/* Generate a list of the distinct pairs of factors of a given
integer N, where each factor is greater than one. */
factorizations(N,FactorList) :- factorization←loop(2,N,FactorList).
factorization←loop(I,N,[]) :- M is I * I, M > N, !.
factorization←loop(I,N,[[I,Q]|F]) :-
divide(N,I,Q,R), R = 0, !, J is I + 1, factorization←loop(J,N,F).
factorization←loop(I,N,F) :- J is I + 1, factorization←loop(J,N,F).
/* Select from a list of integer pairs those pairs with components
less than the number limit (100). */
range←limits([],[]) :- !.
range←limits([[I,J]|T],[[I,J]|R]) :-
constant(number←limit,U), I < U, J < U, !, range←limits(T,R).
range←limits([←|T],R) :- range←limits(T,R).
/* Return a list of elements in the set G -- if the set doesn't
exist, create it and return it. */
the←set←G(List) :- the←set(g,List), !.
the←set←G(List) :- define←G, the←set(g,List).
/* Define the set G by using the set F to form all admissible
products and asserting the set into the global database. */
define←G :- the←set←F(F), build←products(F,G), assertz(the←set(g,G)).
/* Create the set of all products formed from pairs of integers
that sum to one of the elements in the set F. */
build←products([],[]) :- !.
build←products([N|T],R) :-
candidate←sums(N,X), form←products(X,P), build←products(T,U), !,
merge←sets(P,U,R).
/* Convert a list of integer pairs into a list of products of those
pairs. */
form←products([],[]) :- !.
form←products([[F1,F2]|T],[P|Q]) :- P is F1 * F2, form←products(T,Q).
/* Merge two lists of integers to form a third list containing no
duplicated elements. The integers in all three lists are in
ascending order. */
merge←sets(A,[],A).
merge←sets([],B,B).
merge←sets([H|T],B,C) :- add←set←element(H,B,D), !, merge←sets(T,D,C).
/* Merge a single integer into its proper place in a list of integers
arranged in ascending order. */
add←set←element(E,[],[E]) :- !.
add←set←element(E,[H|T],[H|T]) :- E = H, !. /* Ignore duplicate. */
add←set←element(E,[H|T],[H|R]) :- E > H, !, add←set←element(E,T,R).
add←set←element(E,L,[E|L]). /* E < H, Insert E. */
/* Return a list of the elements in the set H -- if the set doesn't
exist, create it and return it. */
the←set←H(List) :- the←set(h,List), !.
the←set←H(List) :- define←H, the←set(h,List).
/* Define the set H as factor pairs constructed from those
elements of the set G having only one factorization with
components that sum to elements in the set F. Assert the
set H into the global database. */
define←H :- the←set←G(G), select←singletons(G,H), assertz
(the←set(h,H)).
/* For each product, find its factorizations and return the
single factor pair that sums to an element in the set F
(if and only if such a pair exists). */
select←singletons([],[]) :- !.
select←singletons([P|T],[C|V]) :-
factorizations(P,Q), belongs←to←F(Q,U), length(U,L), L = 1, !,
car(U,C), select←singletons(T,V).
select←singletons([P|T],V) :- select←singletons(T,V).
/* Select only those pairs in a list of integer pairs whose
sum belongs to the set F. */
belongs←to←F([],[]) :- !.
belongs←to←F([[U,V]|T],[[U,V]|R]) :-
A is U + V, the←set←F(F), member(A,F), !, belongs←to←F(T,R).
belongs←to←F([Q|T],R) :- belongs←to←F(T,R).
/* Return a list of the elements in the set I -- if the set doesn't
exist, create it and return it. */
the←set←I(List) :- the←set(i,List), !.
the←set←I(List) :- define←I, the←set(i,List).
/* Define the set I to be those pairs in the set H that sum to a
single element in the set F. Assert the set I into the global
database. */
define←I :- the←set←F(F), the←set←H(H),
associate←pairs(F,H,I), assertz(the←set(i,I)).
/* For each integer in the set F, find those pairs in the set
H whose sum is that integer. Identify the integers in the
set F to which only one pair in the set H corresponds and
retain the pairs corresonding to those integers. */
associate←pairs([],←,[]) :- !.
associate←pairs([N|T],H,[Z|R]) :-
scan←pairs(N,H,Q), length(Q,L), L = 1, !, car(Q,Z),
associate←pairs(T,H,R).
associate←pairs([N|T],H,R) :- associate←pairs(T,H,R).
/* From a list of integer pairs, build a list of those whose
sum is a specified integer. */
scan←pairs(←,[],[]) :- !.
scan←pairs(N,[[U,V]|T], [[U,V]|R]) :-
A is U + V, A = N, !, scan←pairs(N,T,R).
scan←pairs(N,[H|T],R) :- scan←pairs(N,T,R).
/* From the set I, display the solution to the Mr. S and
Mr. P Problem. */
the←solution :-
the←set←I(I), car(I,[M,N]), nl, write('The numbers are: m = '),
write(M), write(' and n = '), write(N), write('.'), nl.
/* A predicate that succeeds if and only if Candidate belongs to
the list. */
member(Candidate,[Candidate|←]).
member(Candidate,[←|Tail]) :- member(Candidate,Tail).
/* Extract the first element of a list. */
car([],[]).
car([First|Rest],First).
/* Compute the quotient Q and the remainder R of X divided by
Y. */
divide(X,Y,Q,R) :-
nonvar(X), nonvar(Y), var(Q), var(R), !,
Q is X / Y, R is X mod Y.
divide(X,Y,Q,R) :-
var(X), nonvar(Y), nonvar(Q), nonvar(R), !,
X is Q * Y + R.
divide(X,Y,Q,R) :-
nonvar(X), var(Y), nonvar(Q), nonvar(R), !,
Y is (X - R) / Q.
divide(←,←,←,←) :- write('Insufficient Information'), fail.
------------------------------
End of PROLOG Digest
********************
∂04-Jan-85 1601 JMC PROLOG Digest V2 #40
To: KUO
∂28-Dec-84 0244 RESTIVO@SU-SCORE.ARPA PROLOG Digest V2 #40
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 28 Dec 84 02:43:52 PST
Date: Sunday, December 16, 1984 12:22PM
From: Chuck Restivo (The Moderator) <PROLOG-REQUEST@SU-SCORE.ARPA>
Reply-to: PROLOG@SU-SCORE.ARPA
US-Mail: P.O. Box 4584 Stanford University, Stanford CA 94305
Phone: (415) 326-5550
Subject: PROLOG Digest V2 #40
To: PROLOG@SU-SCORE.ARPA
PROLOG Digest Monday, 17 Dec 1984 Volume 2 : Issue 40
Today's Topics:
Programming - Infinite Terms,
Puzzles - Integers
----------------------------------------------------------------------
Date: 15 Dec 84 17:28:13 PST (Sat)
From: Sanjai Narain <Narain@Rand-Unix>
Subject: Infinite terms
I think Michel Boyer's definition of 'infinite(A)', for
detecting whether the term A is infinite, is quite sound.
So, in Prologs in which A=B always terminates with success
or failure, we should be able to use the following definition
of full unification:
unify(A,B):-A=B,not(infinite(A)).
However, in Prologs which do not unify infinite terms, A=B
can indeed be non-terminating, as Richard points out, even
when A and B are finite, E.g:
f(X,X,X)=f(Y,[1,1|Y],[1,1,1|Y]).
-- Sanjai Narain
------------------------------
Date: Fri 14 Dec 84 17:34:38-MST
From: Uday Reddy <U-Reddy@UTAH-20.ARPA>
Subject: Narrowing
Thanks to Joe Goguen for mentioning Eqlog. Even though
Eqlog is an application of narrowing, the reason I did
not mention it originally was that it uses narrowing in
a slightly different way from what I suggested. Strictly
speaking, it uses not narrowing but universal unification
as the operational semantics, though narrowing is an
integral part of universal unification.
The technical difference between the two approaches is that
if narrowing is used as the operational semantics in its own
right, Eqlog's restriction that "rewrite rules should be
terminating" is not necessary. This is a significant
restriction, particularly when nonterminating rewrite rules
are considered "useful" under lazy evaluation. Secondly,
this also eliminates the need to have a separate logic part
and an equational part in a language, because general narrowing
subsumes both resolution and rewriting.
-- Uday Reddy
------------------------------
Date: Fri 14 Dec 84 12:27:59-PST
From: Allen Van Gelder <VanGelder@SU-SCORE.ARPA>
Subject: Enumerating a Range of Integers
In the recent discussion of the puzzle concerning integers
in the range 3..98, at least one solution involved axioms
pos(3) ... pos(98). This allows pos(X) to succeed 96 times
with bindings 3, 4, ... , 98. A more flexible and elegant
way to do this is given below. For this program,
?- btwn(3, 98, X).
succeeds 96 times with X bound successively to 3, 4, ... , 98
thus simulating the 96 axioms. A little study shows that besides
integers, you can enumerate any subrange of a set that has an order
relation and a successor function. (However, if this set is finite,
make sure the successor returns some dummy element outside the set
when applied to the max element IN the set.)
:- mode btwn(+, +, -).
:- mode enumlist(+, +, -).
:- mode getelt(+, -).
btwn(M, N, I) :-
enumlist(M, N, L),
getelt(L, I).
enumlist(M, N, []) :- M is N+1.
enumlist(M, N, [M | L]) :-
N >= M,
M1 is M+1,
!,
enumlist(M1, N, L).
getelt([I | ←], I).
getelt([← | L], I) :- getelt(L, I).
------------------------------
Date: 14 Dec 1984 0627-CST
From: Bruce Anderson <Anderson%TI-CSL.CSNet@CSNet-Relay>
Subject: Integers Problem
I have attached my solution to a variant of the Integers Problem
posed by Tim Finin in Vol. 2, Issue 38 of the Digest (November
29,1984). The variant appeared in "W-JS: A Modal Logic of
Knowledge" by Ma Xiwen and Guo Weide, Computer Science Institute,
Peking University, Beijing.
/*
A Prolog Solution to the S and P Puzzle
by Bruce M. Anderson (Anderson@TI-CSL)
November 8, 1984
The S and P puzzle is an example of a problem whose solution is
gradually constrained by dialog between individuals, interpreted
within the context of the individuals' point of view. Following this
brief introduction is a statement of the puzzle, a description of the
reasoning steps that lead to a solution, and the Prolog statements
for generating a solution.
To generate a solution to the S and P puzzle on the DEC-2060,
perform the following steps:
o Execute PROLOG.
o Consult this file.
o Enter "the←solution." when prompted.
For a look at the progression of solution sets as the problem
becomes increasingly constrained, enter: "the←set←F(X).",
"the←set←G(X).","the←set←H(X).", "the←set←I(X).". These responses
may be entered in any order.
The S and P puzzle was solved previously by Jeff Eisen in
Zetalisp on the Lisp Machine. The author is grateful to Jeff
for insightful discussions of the reasoning process needed to
solve this problem.
Mr. S and Mr. P Puzzle
Two numbers m and n are chosen such that 1 < m =< n < 100.
Mr. S is told their sum, and Mr. P is told their product.
The following dialog between Mr. S and Mr. P ensues:
Mr. S: I know you don't know the numbers. I don't know them
either.
Mr. P: Now I know the numbers.
Mr. S: Now I know them too.
In view of the above dialogue, what are the numbers?
The Reasoning Steps
Mr. S:
S11: I know the sum S.
S12: I know you don't know the numbers.
S13: I don't know them either.
Statement S12 implies that the product P = i * j, for all i
and j, constrained by 1 < i =< S/2 and j = S - i, cannot
be uniquely factored. P is uniquely factorable if there is
only one way that P can be written as the product of
two integers i and j, where 1 < i =< j < 100. Statement
S13 implies 6 =< S =< 196.
Define the set F to be those numbers between 6 and 196 that
as sums have constituents that in every case form products
that cannot be uniquely factored. That is,
F = { x | 6 =< x =< 196 AND x = i + j, 1 < i =< x/2, j = x - i
AND y = i * j AND y cannot be uniquely factored }
The sum S must be an element of the set F.
Mr. P:
P11: I know the product P.
P12: Now I know the numbers.
Statement S12 implies that P cannot be uniquely factored.
Mr. P can verify this by inspecting P as Statement P11
indicates. Moreover, at least one pair of factors of P
must form a sum that belongs to the set F. Define the
set G to be those products having factors that sum to
elements in the set F.
G = { z | z = i * j AND i + j belongs to F }
The product P must be an element of the set G.
Statement P12 implies that only one of the factorings of P
can be written as a sum belonging to the set F. A subset
of G consists of those elements for which there exists a
unique factoring that can be written as a sum belonging to F;
let the set H consist of those unique factor pairs.
H = { [i,j] | w = i * j AND i + j belongs to F AND
there exists no p not equal to i,
q not equal to j such that
w = p * q AND p + q belongs to F }
P is the product formed from one of the factor pairs in H;
that pair is the sought-after [m,n].
Mr. S:
S21: Now I know them too.
Statement S21 implies the existence of a unique factor pair in
H that forms the sum S. Let the set I be those pairs in H that
uniquely sum to an element of F; that is,
I = { [i,j] | [i,j] belongs to H AND
there exists no [p,q] in H, p not equal to i,
q not equal to j for which i + j = p + q }
The pair [m,n] must be the single element in I.
*/
/* Upper limit on values of the integers forming the sum and
product */
constant(number←limit,100).
/* Return a list of elements in the set F -- if the set doesn't
exist, create it and return it. */
the←set←F(List) :- the←set(f,List), !.
the←set←F(List) :- define←F, the←set(f,List).
/* Define the set F by establishing the upper limit on the sum,
creating the set, and asserting it into the global database. */
define←F :- constant(number←limit,U), N is 2 * U - 4,
build←sums(6,N,F), assertz(the←set(f,F)).
/* Create a list of sums that qualify for inclusion in the set F
by having no constituents that form a uniquely factorable
product.
For each candidate sum, the constituents are generated, then
tested to see that none can be uniquely factored. */
build←sums(I,N,[]) :- I > N, !.
build←sums(I,N,[I|T]) :-
candidate←sums(I,X), no←unique←factorization(X), !,
J is I + 1, build←sums(J,N,T).
build←sums(I,N,T) :- J is I + 1, build←sums(J,N,T).
/* Generate a list of the unique pairs of numbers, greater
than one, that sum to a given positive integer N. */
candidate←sums(N,List) :- sum←generator(2,N,List).
sum←generator(I,N,[]) :- M is 2 * I, M > N, !.
sum←generator(I,N,[[I,J]|T]) :-
J is N - I, K is I + 1, sum←generator(K,N,T).
/* A predicate that succeeds if none of the products formed from
the pairs of integers in the given list can be factored into
only one pair of integers, each with magnitude less than the
number limit (100). */
no←unique←factorization([]) :- !.
no←unique←factorization([[I,J]|T]) :-
K is I * J, factorizations(K,F), range←limits(F,G),
length(G,L), ((L =< 1, !, fail); no←unique←factorization(T)).
/* Generate a list of the distinct pairs of factors of a given
integer N, where each factor is greater than one. */
factorizations(N,FactorList) :- factorization←loop(2,N,FactorList).
factorization←loop(I,N,[]) :- M is I * I, M > N, !.
factorization←loop(I,N,[[I,Q]|F]) :-
divide(N,I,Q,R), R = 0, !, J is I + 1, factorization←loop(J,N,F).
factorization←loop(I,N,F) :- J is I + 1, factorization←loop(J,N,F).
/* Select from a list of integer pairs those pairs with components
less than the number limit (100). */
range←limits([],[]) :- !.
range←limits([[I,J]|T],[[I,J]|R]) :-
constant(number←limit,U), I < U, J < U, !, range←limits(T,R).
range←limits([←|T],R) :- range←limits(T,R).
/* Return a list of elements in the set G -- if the set doesn't
exist, create it and return it. */
the←set←G(List) :- the←set(g,List), !.
the←set←G(List) :- define←G, the←set(g,List).
/* Define the set G by using the set F to form all admissible
products and asserting the set into the global database. */
define←G :- the←set←F(F), build←products(F,G), assertz(the←set(g,G)).
/* Create the set of all products formed from pairs of integers
that sum to one of the elements in the set F. */
build←products([],[]) :- !.
build←products([N|T],R) :-
candidate←sums(N,X), form←products(X,P), build←products(T,U), !,
merge←sets(P,U,R).
/* Convert a list of integer pairs into a list of products of those
pairs. */
form←products([],[]) :- !.
form←products([[F1,F2]|T],[P|Q]) :- P is F1 * F2, form←products(T,Q).
/* Merge two lists of integers to form a third list containing no
duplicated elements. The integers in all three lists are in
ascending order. */
merge←sets(A,[],A).
merge←sets([],B,B).
merge←sets([H|T],B,C) :- add←set←element(H,B,D), !, merge←sets(T,D,C).
/* Merge a single integer into its proper place in a list of integers
arranged in ascending order. */
add←set←element(E,[],[E]) :- !.
add←set←element(E,[H|T],[H|T]) :- E = H, !. /* Ignore duplicate. */
add←set←element(E,[H|T],[H|R]) :- E > H, !, add←set←element(E,T,R).
add←set←element(E,L,[E|L]). /* E < H, Insert E. */
/* Return a list of the elements in the set H -- if the set doesn't
exist, create it and return it. */
the←set←H(List) :- the←set(h,List), !.
the←set←H(List) :- define←H, the←set(h,List).
/* Define the set H as factor pairs constructed from those
elements of the set G having only one factorization with
components that sum to elements in the set F. Assert the
set H into the global database. */
define←H :- the←set←G(G), select←singletons(G,H), assertz
(the←set(h,H)).
/* For each product, find its factorizations and return the
single factor pair that sums to an element in the set F
(if and only if such a pair exists). */
select←singletons([],[]) :- !.
select←singletons([P|T],[C|V]) :-
factorizations(P,Q), belongs←to←F(Q,U), length(U,L), L = 1, !,
car(U,C), select←singletons(T,V).
select←singletons([P|T],V) :- select←singletons(T,V).
/* Select only those pairs in a list of integer pairs whose
sum belongs to the set F. */
belongs←to←F([],[]) :- !.
belongs←to←F([[U,V]|T],[[U,V]|R]) :-
A is U + V, the←set←F(F), member(A,F), !, belongs←to←F(T,R).
belongs←to←F([Q|T],R) :- belongs←to←F(T,R).
/* Return a list of the elements in the set I -- if the set doesn't
exist, create it and return it. */
the←set←I(List) :- the←set(i,List), !.
the←set←I(List) :- define←I, the←set(i,List).
/* Define the set I to be those pairs in the set H that sum to a
single element in the set F. Assert the set I into the global
database. */
define←I :- the←set←F(F), the←set←H(H),
associate←pairs(F,H,I), assertz(the←set(i,I)).
/* For each integer in the set F, find those pairs in the set
H whose sum is that integer. Identify the integers in the
set F to which only one pair in the set H corresponds and
retain the pairs corresonding to those integers. */
associate←pairs([],←,[]) :- !.
associate←pairs([N|T],H,[Z|R]) :-
scan←pairs(N,H,Q), length(Q,L), L = 1, !, car(Q,Z),
associate←pairs(T,H,R).
associate←pairs([N|T],H,R) :- associate←pairs(T,H,R).
/* From a list of integer pairs, build a list of those whose
sum is a specified integer. */
scan←pairs(←,[],[]) :- !.
scan←pairs(N,[[U,V]|T], [[U,V]|R]) :-
A is U + V, A = N, !, scan←pairs(N,T,R).
scan←pairs(N,[H|T],R) :- scan←pairs(N,T,R).
/* From the set I, display the solution to the Mr. S and
Mr. P Problem. */
the←solution :-
the←set←I(I), car(I,[M,N]), nl, write('The numbers are: m = '),
write(M), write(' and n = '), write(N), write('.'), nl.
/* A predicate that succeeds if and only if Candidate belongs to
the list. */
member(Candidate,[Candidate|←]).
member(Candidate,[←|Tail]) :- member(Candidate,Tail).
/* Extract the first element of a list. */
car([],[]).
car([First|Rest],First).
/* Compute the quotient Q and the remainder R of X divided by
Y. */
divide(X,Y,Q,R) :-
nonvar(X), nonvar(Y), var(Q), var(R), !,
Q is X / Y, R is X mod Y.
divide(X,Y,Q,R) :-
var(X), nonvar(Y), nonvar(Q), nonvar(R), !,
X is Q * Y + R.
divide(X,Y,Q,R) :-
nonvar(X), var(Y), nonvar(Q), nonvar(R), !,
Y is (X - R) / Q.
divide(←,←,←,←) :- write('Insufficient Information'), fail.
------------------------------
End of PROLOG Digest
********************
∂05-Jan-85 1215 JMC Request for comments:
To: su-bboards@SU-AI.ARPA
Here are some news stories, some editorials and columnist opera.
Perhaps there are local opinions.
n155 0249 05 Jan 85
BC-FAIN-COLUMN(COX) Adv06
(FOR RELEASE SUN. JAN. 6)
COMMENTARY: The Death Wish Vigilante
By JIM FAIN
c. 1985 Cox News Service
NEW YORK - Topic A here is neither summit talks nor Super Bowl. It's
the Death Wish Vigilante, and, unless you've ridden the subways with
some regularity, you don't get a vote.
Bernhard Hugo Goetz, mild-mannered electronics engineer, lit up the
Walter Mitty in every strap-hanger when he pulled a pistol Dec. 22
and shot four young blacks who hassled him on a subway.
There was nothing racial in the reaction. Blacks who suffer more
from crime than do whites were extravagant in their praise of the
37-year-old white who decided not to take it anymore. The street joke
is that Mayor Ed Koch wants Goetz in jail so he won't have to face
him as opponent in the upcoming election.
Most of the hero worship flourished before Goetz drove to New
Hampshire and gave himself up. As the facts emerge, they will cloud
the certitudes on everyone's lips. Facts have a way of screwing up
firm convictions.
Platitudes about vigilanteism don't go down well either, however,
because the law's track record is lousy. Subways are a daily
reminder. Goetz had been mugged on the same line in 1981. He fought
back and was hospitalized. One story says he later saw one of his
tormentors mug another man.
Mugging is not an unusual event here. If not a universal experience,
it is surely a familiar one. Nearly every New Yorker has either been
mugged or has a friend or relative who has.
The subway is a crucible because its passengers are hostage. Not
during rush hour. The violence then is impersonal body-jamming,
harming only dignity. But, at other times, you enter with a darting
glance to inventory who might cause trouble. Punks cruising cars can
come any time. Passengers seldom look up.
Avoidance techniques consist mainly of staying out of
menacing-looking situations and keeping the head down. How many
people also carry weapons, I have no idea, but the one guy who used
one roused the worship of millions. After all, we grew up admiring
lonesome strangers in white hats who dispatched robbers from movie
stagecoaches.
It's just as well that a police investigation will show us now all
sides of what happened Dec. 22. Such matters seldom are as clear-cut
as our fantasies make them.
New York is an urban cauldron where you see next year's problems
today. Police lost a measure of control of subways years ago, as they
lost control of sections of the city.
Most citizens can avoid the neighborhoods but can't function without
using the subways, so they ride and grumble. It's not as bad as it
sounds. A 110-pound, street-wise woman I know has ridden for years
and never seen an incident. A tough took a swipe at her purse once,
but her mama had taught her how to hold it.
Still any incident is too many, and there are hundreds every year
amongst the millions who ride. That's unacceptable, but vigilantdism
is a nutty answer - on grounds of personal safety, not legal
ideology. Equity for muggers is far from one of my priorities, but
please don't put me in a car, God, where some frustrated citizen is
spraying lead at fellow passengers, however worthy of killing a
handful of them may be.
If we get mad enough as a society about what's happening, we'll band
together and stop it with beefed-up policing, mutual citizen support
and public indignation. Lone rangers may be magnificent on film but
they're more lethal than bad guys in a crowd where people bleed real
blood.
(Distributed by The New York Times News Service)
nyt-01-05-85 0546est
***************
a044 0322 05 Jan 85
PM-Subway Shooting,0379
Goetz Refuses Bail Offer From Family, Supporter; Will Do It 'His Way'
NEW YORK (AP) - A man accused of shooting four youths on a subway
train has refused bail offers from his family and the hundreds of
people who pledged up to the entire $50,000, but authorities decried
the public support.
''I would not glorify this person under any circumstances,'' police
Commissioner Benjamin Ward said of 37-year-old Bernhard Goetz, who is
charged with the Dec. 22 shootings.
Goetz, of Manhattan, remained in a special section of Rikers Island
city jail today. His attorney, Frank Brenner, said Friday that Goetz
was ''in the process of making arrangements to get himself bailed
out.
''Just when he'll be bailed out I'm not prepared to tell you because
I don't know. But I expect it will be within a matter of days.''
Goetz is charged with four counts of attempted murder in the
shootings of four teen-agers he said tried to rob him and with
possession of a .38-caliber revolver. Two of the victims remain
hospitalized.
Goetz' family has offered to pay his bail, but he turned down the
offer, cousin Ludwig Goetz Jr. of Orlando, Fla., told The New York
Times in an interview published today. ''The bail is not the problem,
it's Bernhard.''
Telephone technicican Jose M. Gonzalez offered his life savings in a
$50,000 cashier's check he brought to a Manhattan court Friday. Goetz
thanked Gonzalez, who had once been robbed, but rejected the offer.
Financial support continued to pour in Friday as the Guardian Angels
patrol group collected $700 from subway riders and pledges of up to
$1,400 were made to a legal defense fund hastily formed in Goetz'
neighborhood.
There was no accounting of what had been collected.
Goetz was being held in a unit of the Rikers Island prison reserved
for notorious or endangered prisoners. He was arraigned Thursday and
was due back in court Jan. 9 to enter pleas on the charges.
Goetz, who had been sought by city police since Dec. 26, turned
himself in to police in Concord, N.H., on Monday. The shooting
occurred on a subway car when the four teen-agers approached Goetz
and asked for a match, then for the time of day, and then for $5,
police said.
AP-NY-01-05-85 0616EST
***************
n149 0244 03 Jan 85
BC-SUBWAY-(Balt.)
Editorial
c. 1984 The Baltimore Sun
Subway Vigilante
Bernhard Hugo Goetz, whom the New York tabloids have dubbed
''Subway Vigilante'' and ''Death Wish Gunman,'' is scheduled to be
returned to New York today to face charges of attempted murder for
shooting four youths who accosted and perhaps threatened him on a
subway. Mr. Goetz fled to New Hampshire when police began closing in
on him. He turned himself in there and waived extradition.
He will be coming home to something of a hero's welcome. When
police established a hotline for tips about the then unidentified
''vigilante'' of the headlines, they were overwhelmed by New Yorkers
calling to applaud his action. The other headline, ''Death Wish
Gunman,'' refers to adecade-old Charles Bronson movie about a New
Yorker who lured hoodlums to attack him on the streets in order that
he might kill them. That movie broke attendance records in New York.
Audience reaction was so enthusiastically pro-gunman that the
phenomenon became the subject of much journalistic, political and
academic discussion -and concern.
That same sort of reaction, discussion and concern are now abundant
in New York and the nation. Both the mayor of New York City and the
governor of New York state have publicly and properly warned against
such self-defense and vigilante action (those are not the same thing;
it is not known yet which Mr. Goetz was engaged in). We say properly
because no modern large city can allow armed individuals to take the
law into their hands in this fashion.
''Why not?'' many law-abiding citizens demand. One good answer is
that such activity is dangerous to the innocent. Vigilantes and the
self-protecting gunman can easily victimize bystanders. Mr. Goetz
fired a pistol four times in a subway car. That no one other than his
assailants was hurt or killed is a bit of luck that won't always be
present in incidents such as this.
We suspect that many New Yorkers calling police to voice support
for Mr. Goetz are merely releasing the fear and frustration that
living in a crime-ridden, crowded big city creates. It's like
cheering Charles Bronson. But for many others, we also suspect, there
is a real belief that this sort of action is needed. Things are that
bad.
Officials in New York and in other cities and states where violent
crime is a major problem had better pay close attention to this
phenomenon. Applause for a real-life ''Death Wish'' Gunman goes
beyond movie fantasies, beyond victims' rights movements, beyond
insistence on tougher sentencing. It is a signal that if the law
enforcement establishment can't make city streets safe, there is a
growing segment of the population that is ready to turn to
unconventional enforcement.
End Editorial, Subway.
nyt-01-03-85 0541est
***************
n136 0039 04 Jan 85
BC-EDIT-SUBWAY Undated
c.1985 N.Y. Times News Service
The N.Y. Times says in an editorial in its editions of Friday, Jan.
4, 1985:
Why Surrender on the Subway?
Is Bernhard Goetz a hero for allegedly shooting four teenagers he
thought were about to mug him on a subway train? Or is he a
trigger-happy vigilante? The questions, reverberating in New York and
beyond, serve mostly to confuse the issue. The choice is not between
taking the law into one's own hands or no law at all. In fact, much
can feasibly be done about subway crime. The Goetz case makes clear
the need to do it.
Reported crimes in the subways increased by about 3.5 percent in
1984, while going down about 3.7 percent on the street. With the city
police regaining manpower and morale, the muggers and chain-snatchers
now prefer the trains.
Still, the absolute amount of serious subway crime is small - 38
reported felonies per day. The larger problem involves mischief that
never gets reflected in the statistics: graffiti, vandalism,
harassing passengers for handouts. The pervasiveness of that mischief
generates fear that a system millions must ride has slipped out of
control.
Can't 3,600 Transit Police officers do a better job of keeping
order? Yes, say police experts, if properly motivated, trained and
aware of the need to take all that mischief as seriously as the 38
felonies. The underlying problem is morale. For years, the Transit
Police force has been considered second-rate, its officers dispirited
by the decrepitude of their environment and equipment. The sourness
extends to the top of city government, where a struggle between the
city police and the Transit Authority over control of the Transit
Police remains unresolved.
The mission of the transit patrol force needs to be clarified and
its motivation built up. That might be done by committing it to a
sustained campaign against quality-of-life offenses, with additional
resources and strong backing from Albany and City Hall. The right
leadership could use such a mandate to inspire the troops. The
muggers would get the message: the cops care again and the system is
coming back under control.
No bureaucratic conflicts ought to deter such a campaign. If the
city police can carry it off better, let the T.A. grant them full
authority. If neither agency seems up to the job, then why not look
again at lively ideas like that of a Police Corps? It would enlarge
and improve police forces, with officers serving three-year stints in
exchange for college scholarships. As originally proposed, their
first task was to have been securing the New York City subway system.
Surrender or self-defense? That's not the issue at all. Mayor Koch
and Governor Cuomo are right to speak out against vigilantism, but
until they accept their duty to the public on the Transit Police
problem, their ringing denunciations miss the point.
nyt-01-04-85 0336est
***************
Extract from New Hampshire story:
As Goetz, wearing a bullet-proof vest under a leather jacket, was
led from the courthouse to the Merrimack County Jail, a reporter
asked if he had anything to say.
''Vultures,'' Goetz replied. Asked who he meant, he said, ''You.''
***
Another extract:
In a 1982 hearing in which he appealed the denial of his request for
a gun permit, Goetz said he had a ''minor permanent injury'' from the
assault. He complained that the mugger ''was kept for two hours and
35 minutes. ... I was there in the Criminal Court Building for six
hours and five minutes,'' and that three weeks later he saw the same
youth attack a couple.
The youth pleaded guilty to misdemeanor assault charges and served
four months of a six-month sentence, authorities said.
n166 0436 05 Jan 85
BC-SUBWAY-(Balt.)2TAKES
By John Schidlovsky
c. 1984 The Baltimore Sun
ADVANCED FOR SUN. JAN. 6.
New York - His neighbors call him a loner and a victim. The
tabloids call him a vigilante. Thousands of New Yorkers call him a
hero.
But Bernhard Hugo Goetz, the man who claims to have shot four
teenagers who asked him for $5 on the subway December 22, has said he
acted because he was ''frightened'' of muggers.
Mr. Goetz, a 37-year-old, self-employed electronics engineer, gave
that explanation to his sister, Bernice Goetz, of Orlando, Fla., who
spoke with him several times after he turned himself in to police in
Concord, N.H., Monday.
''Living in New York taught him to be frightened,'' said Bernice
Goetz of her brother.
Fear is a word that recurs constantly when New Yorkers talk about
riding the subway. So prevalent is this emotion that it has made Mr.
Goetz - who was ordered held on $50,000 cash bail on four charges of
attempted murder - into an extraordinary urban hero.
''I'm glad he did what he did,'' said Jerry Hodges, a 37-year-old
consulting firm employee as he headed toward a subway at a
mid-Manhattan station last week. ''It will put some fear into those
people who prey on others.''
Another subway rider, 28-year-old Lourdes Ramirez, said she didn't
like people taking guns into the subways. But she said she could
understand how someone might get frustrated by all the crime on the
trains.
''It's bad. I know somebody who got stabbed with a screwdriver even
though he gave them all his money,'' she said.
According to New York police, three of the four youths shot in last
month's incident were carrying sharpened screwdrivers. Investigators
said the teenagers approached a male passenger and asked for a match,
then for the time of day and then demanded $5.
Police said the gunman replied, ''I have $5 for each of you,''
reached into his pocket and pulled out a .38-caliber pistol.
At Mr. Goetz's arraignment here Thursday, prosecutor Susan Braver
said he had shot the youths ''methodically'' and ''only stopped
because he ran out of ammunition.''
Two of the teenagers remain hospitalized, and doctors say one of
them might be paralyzed for life. The other two youths have been
released from the hospital.
The news that Mr. Goetz had claimed to be the man some called the
''Death Wish vigilante'' - a term the tabloids here borrowed from the
Charles Bronson movie of the 1970s - shocked some of Mr. Goetz's
neighbors in the well-to-do building on West 14th street where he has
a 9th-floor apartment.
''Bernie was a model citizen,'' said Allan Horwitz, 37, who lives
one floor above Mr. Goetz's unit in the Courtney House, a 236-unit
building on the busy commercial street near Greenwich Village.
Mr. Horwitz said that Mr. Goetz was ''brainy, not brawny,'' and
enjoyed visiting and playing with the Horwitz's four young children.
''Bernie's the kind of guy that if someone punched him, I think
he'd walk away,'' Mr. Horwitz said.
According to acquaintances and family members, Mr. Goetz was born
in New York City, one of four children to German immigrant parents,
Bernhard and Gertrude Goetz. In the late 1940s, the couple moved to
upstate New York where they ran the Silver Lake Dairy in Red Hook.
The Goetzes also operated a bookbinding business.
Robert Bowman, who has worked for the family-run dairy for more
than 30 years, recalled young Bernhard, whose nickname was Bu, as
someone who ''seemed to be a very stable boy'' and close to his
family.
''He was always very quiet, very smart, very courteous,'' said Mr.
Bowman, who said he last saw the younger Bernhard Goetz in September
when they attended the funeral of the senior Mr. Goetz.
The boy went to school at Rhinebeck Central and then to a private
school in St. Gallen, Switzerland. In 1963, the Goetz family moved to
Orlando, where Bernhard Goetz, Sr., went into the home-building
business with his brother, Ludwig.
After graduating from New York University with a degree in nuclear
engineering, Bernhard joined the family in Orlando. He worked in the
family business - which by this time was prospering in the Orlando
real estate boom - as a contractor, and in 1971 he got married. By
the mid-1970s, however, he and his wife, Elizabeth, had divorced.
Always interested in electronics as a child, Mr. Goetz moved back
to New York and started his own electronics firm based in his
apartment. A specialist in repairing generators and transformers, Mr.
Goetz traveled frequently around the country as an electronics
troubleshooter.
Bernice Goetz, his sister, recalled that her brother always liked
New York because of its great variety. But ''he didn't like the
crime,'' she said.
Neighbors of Mr. Goetz say he was deeply upset about an incident
that happened to him in 1981. As he emerged from a subway stop
carrying electronic equipment, Mr. Goetz was accosted by three youths
who tried to rob him. A police officer foiled the effort and one
youth was apprehended.
''He came back to the building all sore and bleeding,'' recalled
Mr. Horwitz of his downstairs neighbor.
What apparently upset Mr. Goetz even more than the physical attack
was that the apprehended youth was soon released. Shortly after the
incident, Mr. Goetz applied for a pistol permit, telling authorities
that he had seen the same youth attack another couple.
But New York police turned down Mr. Goetz's application for a
pistol, saying he had not demonstrated sufficient need to arm
himself. In response, Mr. Goetz went to Florida and obtained a pistol
there, according to investigators who spoke to him last week.
''We knew Bernie had a gun but we didn't know he didn't have a
permit,'' said Mr. Horwitz, who said he and his wife merely asked Mr.
Goetz not to carry his gun when he played with the Horwitz's children.
In recent years, neighbors say, Mr. Goetz became active in
neighborhood and tenant organizations. He helped circulate a petition
asking for greater police protection in the 14th street area, a
neighborhood that has seen increased drug activity and other crime in
recent years.
''Bernie has an abiding concern with the area,'' said Ralph Naden,
the chairman of a neighborhood group called For A Better 14th Street,
or FAB 14. He said he remembered Mr. Goetz attending a large,
anti-crime rally last July.
Some of Mr. Goetz's neighbors felt he seemed a little obsessed with
the crime problem. They recall that Mr. Goetz seemed to have no other
diversions or friendships.
''I never saw him with anyone else,'' said Rodney Dugas, an actor
who has lived in the 14th street apartment building 10 years and who
remembers thinking Mr. Goetz seemed ''a quiet, strange kind of guy.''
Mr. Dugas said his first reaction on hearing that a tenant had been
charged with the ''subway vigilante'' shootings was to say, ''I guess
it's Bernie.''
Although many Courtney House tenants said they supported Mr. Goetz
and promptly began contributing money to his defense, others in the
building said they disapproved of the shooting.
''I thought it was completely excessive force,'' said Steven
Leventhal, a 40-year-old stockbroker. However, he said he understood
his fellow-New Yorkers' praise for Mr. Goetz. ''There's a widespread
sense that there's no justice.''
justice.''
Because the four youths shot on the subway are black and Mr. Goetz
is white, some New Yorkers have feared that the incident might create
racial problems. But that has not happened, partly because even many
black New Yorkers support the subway shootings as an act of
self-defense.
''I would have done exactly the same thing,'' said subway rider
Hodges, who is black. ''Something's got to be done on the subways -
it's like Vietnam down there.''
Mr. Horwitz and others who have known Mr. Goetz said they never
heard him make any racial statements.
''Bernie was not a prejudiced man. He was prejudiced against punks
and marauders,'' Mr. Horwitz said.
End Subway.
nyt-01-05-85 0744est
***************
∂05-Jan-85 1359 JMC re: arpa paragraph(s)
To: CLT
[In reply to message rcvd 05-Jan-85 12:55-PT.]
It looks good enough. Pruning may be wanted but later.
∂05-Jan-85 1403 JMC good words for DARPA
To: RPG, JJW, YOM
I need some. RPG's should cover PW's work as well as his own.
84arpa[1,clt] is plenty. Half that should suffice.
Put it in the third person.
∂05-Jan-85 1409 JMC
To: RA
Please campus mail Dyson review to Elliott Bloom at SLAC.
∂05-Jan-85 1610 JMC re: MCC University Affiliates Program
To: Rindfleisch@SUMEX-AIM.ARPA, EENGELMORE@SUMEX-AIM.ARPA,
Lundstrom@SU-SIERRA.ARPA, JMC@SU-AI.ARPA,
Ullman@SU-SCORE.ARPA, CRC.EJM@SU-SIERRA.ARPA,
Buchanan@SUMEX-AIM.ARPA, Shortliffe@SUMEX-AIM.ARPA,
Genesereth@SUMEX-AIM.ARPA, Nilsson@SU-SCORE.ARPA
CC: Feigenbaum@SUMEX-AIM.ARPA, Rindfleisch@SUMEX-AIM.ARPA
[In reply to message from Rindfleisch@SUMEX-AIM.ARPA sent Sat 5 Jan 85 14:39:29-PST.]
I visited MCC in December and think they have an interesting program. I
talked briefly with Inman and more extensively with Woody Bledsoe, who
is in charge of AI, and with his assistant Dick Martin. I think they have
an interesting and ambitious program and have started a consulting relationship
concerning their AI work. I don't know what they propose in the way of
university relationships, but I think they may turn out to be a worthy
competitor to ICOT and to the IBM efforts along these research lines.
∂05-Jan-85 1620 JMC Radical computing
To: nilsson@SU-SCORE.ARPA
Thanks for the Despain, et. al. opus. It shows very spotty knowledge.
1. I believe there is literature concluding that residue arithmetic,
while workable, doesn't quite compete. Of course, new ideas might
revive it.
2. The Soviet Union is not as mysterious as all that. Their approaches
to computer architecture and chess are quite well understood, since they
have published sufficiently. The first match with them was in 1968 not
1978, and they had a better program and won. The group that did it had
to leave the Institute of Theoretical and Experimental Physics, because
its leader signed a petition against putting Esenin-Volpin in the
nuthouse. Their subsequent efforts have been good, but they didn't
win their more recent competitions and seem to have dropped out.
I have a Finnish analysis of Analytik, the symbolic computing system
referred to in the report. In many ways, it's a take-off on Anthony
Hearn's REDUCE. I'd be glad to give anyone interested a copy.
Their discussion of symbolic manipulation seems to be done in ignorance
of the existence and use of LISP. They apparently don't know that
MACSYMA is programmed in it.
There is nothing about large scale parallel computation in the report.
The most valuable part is the attempt to revive residue arithmetic. I
don't have an opinion on whether it has real possibilities.
Their speculations about the Soviets strike me as ludicrous. Of course,
the Soviets keep a lot secret, but there is no evidence of a substantial
separate secret line of computer development that is more successful
than what they show to visitors. What visitors have been seeing for
the last 25 years has clear roots in previous published Soviet work
and in Western work. Unless more than half of the Soviet Academy of
Sciences is engaged in operating reverse Potemkin villages to confuse
us, there isn't anything revolutionary going on there. Soviet scientists,
emigres, and all the available evidence tell us that the military related
institutions have priorities on computer equipment, so they get the
same stuff earlier and in greater quantities but use the same computers
as everyone else there.
As to its quality, when Ed Fredkin asked for the prototype BESM-6 for
the computer museum, they told him that this 1966 7094 class computer
was still in use at the Academy of Sciences Computation Center in Moscow.
I thought the Jasons were better than that. Oh well, it shows the power
of secrecy to conceal ignorance.
∂05-Jan-85 1642 JMC
To: gripe
Whenever I send mail to SU-BBOARDS I get this message from SU-PSYCH.
Perhaps SU-PSYCH should be deleted from the list of recipients of
BBOARD messages.
∂05-Jan-85 1636 MAILER-DAEMON@SU-PSYCH Returned mail: unknown mailer error 13
Received: from PSYCH by SU-AI.ARPA with TCP; 5 Jan 85 16:35:50 PST
Date: 05 Jan 85 1215 PST
From: MAILER-DAEMON@SU-PSYCH (Mail Delivery Subsystem)
Subject: Returned mail: unknown mailer error 13
To: <JMC@SU-AI.ARPA>
----- Transcript of session follows -----
/usr/spool/bboard/bounds: Permission denied
554 "|/usr/stanford/bin/bboard -s"... unknown mailer error 13
----- Unsent message follows -----
Received: from SU-AI.ARPA by SU-PSYCH with TCP; Sat, 5 Jan 85 16:35:27 pst
Date: 05 Jan 85 1215 PST
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: Request for comments:
To: su-bboards@SU-AI.ARPA
Here are some news stories, some editorials and columnist opera.
Perhaps there are local opinions.
n155 0249 05 Jan 85
BC-FAIN-COLUMN(COX) Adv06
(FOR RELEASE SUN. JAN. 6)
COMMENTARY: The Death Wish Vigilante
By JIM FAIN
c. 1985 Cox News Service
NEW YORK - Topic A here is neither summit talks nor Super Bowl. It's
the Death Wish Vigilante, and, unless you've ridden the subways with
some regularity, you don't get a vote.
Bernhard Hugo Goetz, mild-mannered electronics engineer, lit up the
Walter Mitty in every strap-hanger when he pulled a pistol Dec. 22
and shot four young blacks who hassled him on a subway.
There was nothing racial in the reaction. Blacks who suffer more
from crime than do whites were extravagant in their praise of the
37-year-old white who decided not to take it anymore. The street joke
is that Mayor Ed Koch wants Goetz in jail so he won't have to face
him as opponent in the upcoming election.
Most of the hero worship flourished before Goetz drove to New
Hampshire and gave himself up. As the facts emerge, they will cloud
the certitudes on everyone's lips. Facts have a way of screwing up
firm convictions.
Platitudes about vigilanteism don't go down well either, however,
because the law's track record is lousy. Subways are a daily
reminder. Goetz had been mugged on the same line in 1981. He fought
back and was hospitalized. One story says he later saw one of his
tormentors mug another man.
Mugging is not an unusual event here. If not a universal experience,
it is surely a familiar one. Nearly every New Yorker has either been
mugged or has a friend or relative who has.
The subway is a crucible because its passengers are hostage. Not
during rush hour. The violence then is impersonal body-jamming,
harming only dignity. But, at other times, you enter with a darting
glance to inventory who might cause trouble. Punks cruising cars can
come any time. Passengers seldom look up.
Avoidance techniques consist mainly of staying out of
menacing-looking situations and keeping the head down. How many
people also carry weapons, I have no idea, but the one guy who used
one roused the worship of millions. After all, we grew up admiring
lonesome strangers in white hats who dispatched robbers from movie
stagecoaches.
It's just as well that a police investigation will show us now all
sides of what happened Dec. 22. Such matters seldom are as clear-cut
as our fantasies make them.
New York is an urban cauldron where you see next year's problems
today. Police lost a measure of control of subways years ago, as they
lost control of sections of the city.
Most citizens can avoid the neighborhoods but can't function without
using the subways, so they ride and grumble. It's not as bad as it
sounds. A 110-pound, street-wise woman I know has ridden for years
and never seen an incident. A tough took a swipe at her purse once,
but her mama had taught her how to hold it.
Still any incident is too many, and there are hundreds every year
amongst the millions who ride. That's unacceptable, but vigilantdism
is a nutty answer - on grounds of personal safety, not legal
ideology. Equity for muggers is far from one of my priorities, but
please don't put me in a car, God, where some frustrated citizen is
spraying lead at fellow passengers, however worthy of killing a
handful of them may be.
If we get mad enough as a society about what's happening, we'll band
together and stop it with beefed-up policing, mutual citizen support
and public indignation. Lone rangers may be magnificent on film but
they're more lethal than bad guys in a crowd where people bleed real
blood.
(Distributed by The New York Times News Service)
nyt-01-05-85 0546est
***************
a044 0322 05 Jan 85
PM-Subway Shooting,0379
Goetz Refuses Bail Offer From Family, Supporter; Will Do It 'His Way'
NEW YORK (AP) - A man accused of shooting four youths on a subway
train has refused bail offers from his family and the hundreds of
people who pledged up to the entire $50,000, but authorities decried
the public support.
''I would not glorify this person under any circumstances,'' police
Commissioner Benjamin Ward said of 37-year-old Bernhard Goetz, who is
charged with the Dec. 22 shootings.
Goetz, of Manhattan, remained in a special section of Rikers Island
city jail today. His attorney, Frank Brenner, said Friday that Goetz
was ''in the process of making arrangements to get himself bailed
out.
''Just when he'll be bailed out I'm not prepared to tell you because
I don't know. But I expect it will be within a matter of days.''
Goetz is charged with four counts of attempted murder in the
shootings of four teen-agers he said tried to rob him and with
possession of a .38-caliber revolver. Two of the victims remain
hospitalized.
Goetz' family has offered to pay his bail, but he turned down the
offer, cousin Ludwig Goetz Jr. of Orlando, Fla., told The New York
Times in an interview published today. ''The bail is not the problem,
it's Bernhard.''
Telephone technicican Jose M. Gonzalez offered his life savings in a
$50,000 cashier's check he brought to a Manhattan court Friday. Goetz
thanked Gonzalez, who had once been robbed, but rejected the offer.
Financial support continued to pour in Friday as the Guardian Angels
patrol group collected $700 from subway riders and pledges of up to
$1,400 were made to a legal defense fund hastily formed in Goetz'
neighborhood.
There was no accounting of what had been collected.
Goetz was being held in a unit of the Rikers Island prison reserved
for notorious or endangered prisoners. He was arraigned Thursday and
was due back in court Jan. 9 to enter pleas on the charges.
Goetz, who had been sought by city police since Dec. 26, turned
himself in to police in Concord, N.H., on Monday. The shooting
occurred on a subway car when the four teen-agers approached Goetz
and asked for a match, then for the time of day, and then for $5,
police said.
AP-NY-01-05-85 0616EST
***************
n149 0244 03 Jan 85
BC-SUBWAY-(Balt.)
Editorial
c. 1984 The Baltimore Sun
Subway Vigilante
Bernhard Hugo Goetz, whom the New York tabloids have dubbed
''Subway Vigilante'' and ''Death Wish Gunman,'' is scheduled to be
returned to New York today to face charges of attempted murder for
shooting four youths who accosted and perhaps threatened him on a
subway. Mr. Goetz fled to New Hampshire when police began closing in
on him. He turned himself in there and waived extradition.
He will be coming home to something of a hero's welcome. When
police established a hotline for tips about the then unidentified
''vigilante'' of the headlines, they were overwhelmed by New Yorkers
calling to applaud his action. The other headline, ''Death Wish
Gunman,'' refers to adecade-old Charles Bronson movie about a New
Yorker who lured hoodlums to attack him on the streets in order that
he might kill them. That movie broke attendance records in New York.
Audience reaction was so enthusiastically pro-gunman that the
phenomenon became the subject of much journalistic, political and
academic discussion -and concern.
That same sort of reaction, discussion and concern are now abundant
in New York and the nation. Both the mayor of New York City and the
governor of New York state have publicly and properly warned against
such self-defense and vigilante action (those are not the same thing;
it is not known yet which Mr. Goetz was engaged in). We say properly
because no modern large city can allow armed individuals to take the
law into their hands in this fashion.
''Why not?'' many law-abiding citizens demand. One good answer is
that such activity is dangerous to the innocent. Vigilantes and the
self-protecting gunman can easily victimize bystanders. Mr. Goetz
fired a pistol four times in a subway car. That no one other than his
assailants was hurt or killed is a bit of luck that won't always be
present in incidents such as this.
We suspect that many New Yorkers calling police to voice support
for Mr. Goetz are merely releasing the fear and frustration that
living in a crime-ridden, crowded big city creates. It's like
cheering Charles Bronson. But for many others, we also suspect, there
is a real belief that this sort of action is needed. Things are that
bad.
Officials in New York and in other cities and states where violent
crime is a major problem had better pay close attention to this
phenomenon. Applause for a real-life ''Death Wish'' Gunman goes
beyond movie fantasies, beyond victims' rights movements, beyond
insistence on tougher sentencing. It is a signal that if the law
enforcement establishment can't make city streets safe, there is a
growing segment of the population that is ready to turn to
unconventional enforcement.
End Editorial, Subway.
nyt-01-03-85 0541est
***************
n136 0039 04 Jan 85
BC-EDIT-SUBWAY Undated
c.1985 N.Y. Times News Service
The N.Y. Times says in an editorial in its editions of Friday, Jan.
4, 1985:
Why Surrender on the Subway?
Is Bernhard Goetz a hero for allegedly shooting four teenagers he
thought were about to mug him on a subway train? Or is he a
trigger-happy vigilante? The questions, reverberating in New York and
beyond, serve mostly to confuse the issue. The choice is not between
taking the law into one's own hands or no law at all. In fact, much
can feasibly be done about subway crime. The Goetz case makes clear
the need to do it.
Reported crimes in the subways increased by about 3.5 percent in
1984, while going down about 3.7 percent on the street. With the city
police regaining manpower and morale, the muggers and chain-snatchers
now prefer the trains.
Still, the absolute amount of serious subway crime is small - 38
reported felonies per day. The larger problem involves mischief that
never gets reflected in the statistics: graffiti, vandalism,
harassing passengers for handouts. The pervasiveness of that mischief
generates fear that a system millions must ride has slipped out of
control.
Can't 3,600 Transit Police officers do a better job of keeping
order? Yes, say police experts, if properly motivated, trained and
aware of the need to take all that mischief as seriously as the 38
felonies. The underlying problem is morale. For years, the Transit
Police force has been considered second-rate, its officers dispirited
by the decrepitude of their environment and equipment. The sourness
extends to the top of city government, where a struggle between the
city police and the Transit Authority over control of the Transit
Police remains unresolved.
The mission of the transit patrol force needs to be clarified and
its motivation built up. That might be done by committing it to a
sustained campaign against quality-of-life offenses, with additional
resources and strong backing from Albany and City Hall. The right
leadership could use such a mandate to inspire the troops. The
muggers would get the message: the cops care again and the system is
coming back under control.
No bureaucratic conflicts ought to deter such a campaign. If the
city police can carry it off better, let the T.A. grant them full
authority. If neither agency seems up to the job, then why not look
again at lively ideas like that of a Police Corps? It would enlarge
and improve police forces, with officers serving three-year stints in
exchange for college scholarships. As originally proposed, their
first task was to have been securing the New York City subway system.
Surrender or self-defense? That's not the issue at all. Mayor Koch
and Governor Cuomo are right to speak out against vigilantism, but
until they accept their duty to the public on the Transit Police
problem, their ringing denunciations miss the point.
nyt-01-04-85 0336est
***************
Extract from New Hampshire story:
As Goetz, wearing a bullet-proof vest under a leather jacket, was
led from the courthouse to the Merrimack County Jail, a reporter
asked if he had anything to say.
''Vultures,'' Goetz replied. Asked who he meant, he said, ''You.''
***
Another extract:
In a 1982 hearing in which he appealed the denial of his request for
a gun permit, Goetz said he had a ''minor permanent injury'' from the
assault. He complained that the mugger ''was kept for two hours and
35 minutes. ... I was there in the Criminal Court Building for six
hours and five minutes,'' and that three weeks later he saw the same
youth attack a couple.
The youth pleaded guilty to misdemeanor assault charges and served
four months of a six-month sentence, authorities said.
n166 0436 05 Jan 85
BC-SUBWAY-(Balt.)2TAKES
By John Schidlovsky
c. 1984 The Baltimore Sun
ADVANCED FOR SUN. JAN. 6.
New York - His neighbors call him a loner and a victim. The
tabloids call him a vigilante. Thousands of New Yorkers call him a
hero.
But Bernhard Hugo Goetz, the man who claims to have shot four
teenagers who asked him for $5 on the subway December 22, has said he
acted because he was ''frightened'' of muggers.
Mr. Goetz, a 37-year-old, self-employed electronics engineer, gave
that explanation to his sister, Bernice Goetz, of Orlando, Fla., who
spoke with him several times after he turned himself in to police in
Concord, N.H., Monday.
''Living in New York taught him to be frightened,'' said Bernice
Goetz of her brother.
Fear is a word that recurs constantly when New Yorkers talk about
riding the subway. So prevalent is this emotion that it has made Mr.
Goetz - who was ordered held on $50,000 cash bail on four charges of
attempted murder - into an extraordinary urban hero.
''I'm glad he did what he did,'' said Jerry Hodges, a 37-year-old
consulting firm employee as he headed toward a subway at a
mid-Manhattan station last week. ''It will put some fear into those
people who prey on others.''
Another subway rider, 28-year-old Lourdes Ramirez, said she didn't
like people taking guns into the subways. But she said she could
understand how someone might get frustrated by all the crime on the
trains.
''It's bad. I know somebody who got stabbed with a screwdriver even
though he gave them all his money,'' she said.
According to New York police, three of the four youths shot in last
month's incident were carrying sharpened screwdrivers. Investigators
said the teenagers approached a male passenger and asked for a match,
then for the time of day and then demanded $5.
Police said the gunman replied, ''I have $5 for each of you,''
reached into his pocket and pulled out a .38-caliber pistol.
At Mr. Goetz's arraignment here Thursday, prosecutor Susan Braver
said he had shot the youths ''methodically'' and ''only stopped
because he ran out of ammunition.''
Two of the teenagers remain hospitalized, and doctors say one of
them might be paralyzed for life. The other two youths have been
released from the hospital.
The news that Mr. Goetz had claimed to be the man some called the
''Death Wish vigilante'' - a term the tabloids here borrowed from the
Charles Bronson movie of the 1970s - shocked some of Mr. Goetz's
neighbors in the well-to-do building on West 14th street where he has
a 9th-floor apartment.
''Bernie was a model citizen,'' said Allan Horwitz, 37, who lives
one floor above Mr. Goetz's unit in the Courtney House, a 236-unit
building on the busy commercial street near Greenwich Village.
Mr. Horwitz said that Mr. Goetz was ''brainy, not brawny,'' and
enjoyed visiting and playing with the Horwitz's four young children.
''Bernie's the kind of guy that if someone punched him, I think
he'd walk away,'' Mr. Horwitz said.
According to acquaintances and family members, Mr. Goetz was born
in New York City, one of four children to German immigrant parents,
Bernhard and Gertrude Goetz. In the late 1940s, the couple moved to
upstate New York where they ran the Silver Lake Dairy in Red Hook.
The Goetzes also operated a bookbinding business.
Robert Bowman, who has worked for the family-run dairy for more
than 30 years, recalled young Bernhard, whose nickname was Bu, as
someone who ''seemed to be a very stable boy'' and close to his
family.
''He was always very quiet, very smart, very courteous,'' said Mr.
Bowman, who said he last saw the younger Bernhard Goetz in September
when they attended the funeral of the senior Mr. Goetz.
The boy went to school at Rhinebeck Central and then to a private
school in St. Gallen, Switzerland. In 1963, the Goetz family moved to
Orlando, where Bernhard Goetz, Sr., went into the home-building
business with his brother, Ludwig.
After graduating from New York University with a degree in nuclear
engineering, Bernhard joined the family in Orlando. He worked in the
family business - which by this time was prospering in the Orlando
real estate boom - as a contractor, and in 1971 he got married. By
the mid-1970s, however, he and his wife, Elizabeth, had divorced.
Always interested in electronics as a child, Mr. Goetz moved back
to New York and started his own electronics firm based in his
apartment. A specialist in repairing generators and transformers, Mr.
Goetz traveled frequently around the country as an electronics
troubleshooter.
Bernice Goetz, his sister, recalled that her brother always liked
New York because of its great variety. But ''he didn't like the
crime,'' she said.
Neighbors of Mr. Goetz say he was deeply upset about an incident
that happened to him in 1981. As he emerged from a subway stop
carrying electronic equipment, Mr. Goetz was accosted by three youths
who tried to rob him. A police officer foiled the effort and one
youth was apprehended.
''He came back to the building all sore and bleeding,'' recalled
Mr. Horwitz of his downstairs neighbor.
What apparently upset Mr. Goetz even more than the physical attack
was that the apprehended youth was soon released. Shortly after the
incident, Mr. Goetz applied for a pistol permit, telling authorities
that he had seen the same youth attack another couple.
But New York police turned down Mr. Goetz's application for a
pistol, saying he had not demonstrated sufficient need to arm
himself. In response, Mr. Goetz went to Florida and obtained a pistol
there, according to investigators who spoke to him last week.
''We knew Bernie had a gun but we didn't know he didn't have a
permit,'' said Mr. Horwitz, who said he and his wife merely asked Mr.
Goetz not to carry his gun when he played with the Horwitz's children.
In recent years, neighbors say, Mr. Goetz became active in
neighborhood and tenant organizations. He helped circulate a petition
asking for greater police protection in the 14th street area, a
neighborhood that has seen increased drug activity and other crime in
recent years.
''Bernie has an abiding concern with the area,'' said Ralph Naden,
the chairman of a neighborhood group called For A Better 14th Street,
or FAB 14. He said he remembered Mr. Goetz attending a large,
anti-crime rally last July.
Some of Mr. Goetz's neighbors felt he seemed a little obsessed with
the crime problem. They recall that Mr. Goetz seemed to have no other
diversions or friendships.
''I never saw him with anyone else,'' said Rodney Dugas, an actor
who has lived in the 14th street apartment building 10 years and who
remembers thinking Mr. Goetz seemed ''a quiet, strange kind of guy.''
Mr. Dugas said his first reaction on hearing that a tenant had been
charged with the ''subway vigilante'' shootings was to say, ''I guess
it's Bernie.''
Although many Courtney House tenants said they supported Mr. Goetz
and promptly began contributing money to his defense, others in the
building said they disapproved of the shooting.
''I thought it was completely excessive force,'' said Steven
Leventhal, a 40-year-old stockbroker. However, he said he understood
his fellow-New Yorkers' praise for Mr. Goetz. ''There's a widespread
sense that there's no justice.''
justice.''
Because the four youths shot on the subway are black and Mr. Goetz
is white, some New Yorkers have feared that the incident might create
racial problems. But that has not happened, partly because even many
black New Yorkers support the subway shootings as an act of
self-defense.
''I would have done exactly the same thing,'' said subway rider
Hodges, who is black. ''Something's got to be done on the subways -
it's like Vietnam down there.''
Mr. Horwitz and others who have known Mr. Goetz said they never
heard him make any racial statements.
''Bernie was not a prejudiced man. He was prejudiced against punks
and marauders,'' Mr. Horwitz said.
End Subway.
nyt-01-05-85 0744est
***************
∂05-Jan-85 1737 JMC
To: CLT
Fouch`e was indeed the head of Napoleon's secret police.
∂05-Jan-85 1821 JMC radical computing
To: nilsson@SU-SCORE.ARPA
I was mistaken in saying that they didn't know MACSYMA was written in
LISP. I was expecting them to mention LISP in the section that mentions
Prolog and functional programming and suggests that a new language
was necessary.
∂05-Jan-85 2217 JMC re: Request for comments: (from SAIL's BBOARD)
To: OTHER-SU-BBOARDS@SU-AI.ARPA
jmc - The phrase in question, constituting the second amendment to the
Constitution is precisely this. "A well regulated Militia, being necessary
to the security of a free State, the right of the people to keep and
bear Arms, shall not be infringed."
∂05-Jan-85 2340 JMC symbol
To: SMC
Carolyn criticizes Knuth for omitting those two symbols and points
out that they can be manufactured by putting rules around an empty
box. Can you do this without her help? She says you already have
a symbol that's a box with four rules around it.
∂07-Jan-85 0050 JMC re: Request for comments: (from SAIL's BBOARD)
To: OTHER-SU-BBOARDS@SU-AI.ARPA
jmc - A few questions and comments.
1. What is the appropriate penalty for Mr. Goetz? What about
the penalty for his attackers? What are the likely penalties.
2. Peter Karp says
"Muggers are poor, angry, frustrated, and in general live within a
subculture which to a large degree forces many of them to commmit crimes.
I am not attempting to resolve muggers of all responsibility for their
actions - that is another issue. I am saying that how muggers think
people will react to attack merely influences which victims they choose,
it doesn't deal with the causes of their behaviour."
This suggests that the only way to reduce mugging is to reduce poverty.
This is very difficult, and it may not even work. Predatory cultures
have existed before, and the most prominent examples have nothing to
do with poverty. I have just been reading David Hume's History of
England, and the period from the Norman Conquest to the accession
of Henry VII is just one long struggle among muggers. The situation
improved after that somewhat, because Henry VII was a dictator, and
because the worst of the noble families killed each other off in the
Wars of the Roses.
My impression is that past predatory cultures have been replaced only
by violent suppression of the predatory behavior. Often this suppression
has been accomplished by the most violent of the predators.
3. Mr. Goetz will probably get off of everything but the gun charge
if he adopts the Twinky defense, i.e. claims temporary insanity.
Less feasible is a claim of self defense, because the present legal criteria
for self defense may not be met. Still a jury may accept that claim
no matter what the judge tells them.
However, it looks like he may be another Michael Kohlhaus. He may
say that the reason he carried the gun was in order to shoot some
muggers and demand that the court system agree that this was a
proper thing for him to do.
Let me recommend the novel "Michael Kohlhaus" by Heinrich von Kleist.
In that story the muggers were robber barons. In it the hero gets
revenge for a robbery, and everyone agrees that he was entitled to
some revenge, but he demands a degree of absolution and reparation
that the Emperor can't give, and Kohlhaus eventually perishes when
his rebellion is suppressed.
∂07-Jan-85 1851 JMC
To: aaai-office@SUMEX-AIM.ARPA
I think we should give rebates only on the basis of a statement
that full expenses weren't covered and then to the extent of the
underpayment. You should ask for letters about underpayment and
then divide up what's left.
∂07-Jan-85 1909 JMC JOB FOR SCRIBE WIZARD
To: SMC
∂07-Jan-85 1646 evan@Umunhum JOB FOR SCRIBE WIZARD
Received: from SU-NAVAJO.ARPA by SU-AI.ARPA with TCP; 7 Jan 85 16:46:22 PST
Received: from Umunhum.ARPA by Navajo.ARPA with TCP; Mon, 7 Jan 85 16:43:08 pst
Date: Mon, 7 Jan 85 16:46:09 pst
From: Evan Tick <evan@Umunhum>
Subject: JOB FOR SCRIBE WIZARD
To: su-bboards@Umunhum
Quintus Computer Company, 2345 Yale Street, Palo Alto
is offering unlimited quantities of part-time SCRIBE
hacking work to anyone proficient in SCRIBE. Pay
negotiable - may be possible to work at STANFORD over
the network.
Don't contact me! Contact Jennifer Zimmerman at
415-494-3612.
∂08-Jan-85 1651 JMC re: scribe
To: SMC
[In reply to message rcvd 08-Jan-85 16:34-PT.]
My suggestion is you tell them what you put in your message to me. If
what they require is a genuine Scribe wizard, i.e. someone who will
answer other people's questions about Scribe, they won't hire you.
However, if they can't get such a person, then if you claim to be able
to to Scribe by reference to the manual on the basis of Tex experience,
they will hire you if that's the best they can do.
∂08-Jan-85 1652 JMC re: FULL FAULTY MEETING TODAY
To: OLENDER@SU-SCORE.ARPA
[In reply to message sent Tue 8 Jan 85 13:04:48-PST.]
How did you know the meeting would be FAULTY?
∂08-Jan-85 2122 JMC
To: restivo@SU-SCORE.ARPA
See these two files. There's more if you want it.
KK[S79,JMC] Ma's Mr. S and Mr. P
KK.PRF[S79,JMC] Ma's FOL proof of Mr. S and Mr. P
∂08-Jan-85 2136 JMC goetz
To: su-bboards@SU-AI.ARPA
Note the following points in the following news story.
1. the stuff about waiving immunity
2. the propaganda from the attorneys for the alleged alleged muggers.
3. the alleged alleged muggers have 10 bench outstanding bench warrants
for not showing up for trials. One may conjecture that if each had been
kept in jail on being caught in a second crime after failing to show up
for trial on the first, they would not have been led into temptation to
try to mug Goetz. Perhaps some attorney can get damages from
the city for this negligence.
n096 1839 08 Jan 85
AM-GOETZ
By MARCIA CHAMBERS
c.1985 N.Y. Times News Service
NEW YORK - Bernhard Hugo Goetz, who is accused of attempting to
murder four teen-agers on a subway train last month, posted $50,000
cash bail and was released from a Rikers Island jail late Tuesday
afternoon.
Edward Hershey, a spokesman for the city's Department of Correction,
said he believed that Goetz had used his own money to bail himself
out of the jail, where he had been held in a special unit since
Thursday.
Goetz, a 37-year-old electronics specialist, had refused offers from
the public and from his family to help with the bail. He said he
wanted to take care of it himself.
Frank Brenner, Goetz's lawyer, said he had been surprised by his
client's leaving jail. ''I don't know why he did it,'' Brenner said
from his office. ''I did not know about it.''
Hershey said later that the Correction Department had helped to
arrange Goetz's release ''in a private manner.'' He said correction
employees processed the bail papers so that word of Goetz's departure
would be kept secret. ''We wanted to do this in an orderly manner,''
he said. ''It was his wish and it helped to avoid a security problem
for us.''
Hershey would not give specific details, such as the transportation
Goetz used to leave the jail or who, if anyone, accompanied him.
It was not immediately clear why Goetz decided to leave jail Tuesday
or where he went after he left. Goetz was scheduled to appear in
court Wednesday.
Had he not posted the bail, a Criminal Court judge would have been
required to release Goetz in his own custody unless the Manhattan
district attorney either held a preliminary hearing on the charges
against him, announced that a grand jury hearing the case had acted,
or showed ''good cause'' why Goetz should not be released.
In other developments in the case Tuesday, the district attorney,
Robert M. Morgenthau, refused to grant immunity from prosecution to
three of the four teen-agers who were shot by Goetz on an IRT No. 2
train last month after they asked him for money. As a result, they
refused to testify before a Manhattan grand jury Tuesday. The fourth
youth remained hospitalized.
Morgenthau would not say so, but lawyers familiar with the case said
he did not want to run the risk that their having testified could
make the teen-agers immune from prosecution for other criminal
charges pending in Manhattan and in the Bronx.
A witness who testifies before a grand jury in New York state is
granted automatic immunity from prosecution for the crime at hand as
well as for any other crime he may happen to mention, unless the
witness waives his immunity. All four of the victims of the subway
shooting have other court cases waiting.
Goetz's lawyer, Brenner, said Goetz had also decided not to testify
before the grand jury. Brenner said Tuesday that Goetz made the
decision not to testify after Brenner explained the consequences of
testifying. If Goetz had decided to tell his story to the grand jury,
the prosecutor would have required him to waive his immunity from
prosecution.
''He made the decision,'' Brenner said. As a result, Brenner did not
notify the Manhattan district attorney's office that his client
wanted to testify.
Although neither Goetz nor the three teen-agers are expected to
testify, indictments of Goetz or of the young men might still be
returned by the grand jury. The members of the grand jury are said to
be evaluating photographs taken at the scene of the subway shootings,
medical evidence and Goetz's lengthy statement and video-taped
interview that he gave to the police in New Hampshire, where he
surrendered.
Three of the four teen-agers were subpoenaed to testify before the
grand jury Tuesday afternoon. The three were Troy Canty, 19 years
old, who has said he asked Goetz for $5, Barry Allen, 18, and James
Ramseur, 18, who was brought to the Manhattan Criminal Court building
from Bellevue Hospital. Ramseur was described by one of the attorneys
as being in ''excruciating pain.''
The fourth teen-ager, Darryl Cabey, 19, is believed to be paralyzed
from the waist down and could not be moved from his hospital bed.
Cabey is under indictment in the Bronx, charged with armed robbery.
He faces up to 25 years in prison if convicted of that charge.
During the grand jury session Tuesday, each of the three young men
was asked one question by Susan Braver, the prosecutor handling the
case: ''Do you wish to waive immunity?''
Each said that, on the advice of counsel, he did not.
Howard Meyer, Canty's attorney, said after his client emerged from
the grand jury room that it ''was rare for the District Attorney to
ask a victim to waive immunity.''
''I think it was unusual to bring them in knowing that they would
refuse to sign a waiver,'' Meyer said. ''James was in great pain,
moaning and holding his stomach when he walked in.''
The four teen-agers, all from the Bronx,have criminal
records, mainly in the Bronx. They have had a total of 10 bench
warrants issued for their arrests because they failed to keep court
dates.
The most serious felony charge is against Cabey, who is accused of
committing an armed rbbery last Oct. 13, with what the police said
appeared to be a shotgun. Cabey was indicted on that charge by a
Bronx grand jury but was released on bail and was awaiting trial when
he was shot in the subway incident last Dec. 22.
nyt-01-08-85 2135est
***************
∂08-Jan-85 2302 JMC re: OR colloquium by Karmarkar, Jan. (yes JAN.) 11, 1985
To: WIEDERHOLD@SU-SCORE.ARPA
[In reply to message sent Tue 8 Jan 85 22:34:55-PST.]
In case anyone cares you have propagated an erroneous version
of the Karmarkar abstract. Cottle supplied me with the following
corrected version. The original version is meaningless, since the
ratio referred to is obviously zero.
We present a new polynomial-time algorithm for linear programming.
The running time of the algorithm is O(n↑3.5L↑2), as compared with
O(n↑6L↑2) for the ellipsoid algorithm. We prove that given a polytope
P and a strictly interior point a in P, there is a projective
transformation of the space that maps P,a to P',a' having the
following property. The ratio of the radius of the smallest sphere
with center a' CONTAINING P' to the radius of the largest sphere with
center a' contained in P' is O(n). The algorithm consists of repeated
application of such projective transformations followed by
optimization of an inscribed sphere to create a sequence of points
which converge to the optimal solution in polynomial time.
∂09-Jan-85 0046 JMC If threatened with mugging, say
To: su-bboards@SU-AI.ARPA
"I've got five dollars for each of you" and hope it give you a head
start in running away.
∂09-Jan-85 0121 JMC mentioning Church-Rosser
To: boyer@UTEXAS-20.ARPA
I am giving a talk at the meeting of the Association for Symbolic
Logic in Anaheim of Saturday. Mainly it will about non-monotonic
reasoning and logic in AI. However, if I want to mention the state
of the art in interactive theorem proving, it would be nice to
mention your student's proof of Church-Rosser. Would that be ok,
and if so, what is his name. Don't hesitate to say no if you
are planning something dramatic, because it would only be peripheral
to my talk.
∂09-Jan-85 1801 JMC re: New Director
To: BARWISE@SU-CSLI.ARPA
CC: hk.gjl@SU-FORSYTHE.ARPA
[In reply to message sent Wed 9 Jan 85 16:09:40-PST.]
John Perry will be fine as director of csli.
∂09-Jan-85 2148 JMC re: more self defense meat (from SAIL's BBOARD)
To: OTHER-SU-BBOARDS@SU-AI.ARPA
jmc - Every kind of trap that injures thieves is illegal. Since in the
cases I have read about, there was no discussion of variation from
state to state, I suspect it's an inheritance from English common law.
I believe I've read that the original kind of traps were gun traps
to catch poachers. The disproportion between death and the crime
of catching someone else's wild rabbit may have been what started it.
Every few years there are news stories about cases that strike the
public as unjust. For example, a burglar burgled the same farmhouse
three times. The third time there was a gun trap, and the farmer
lost his farm to pay damages to the burglar. The case was in the
news for over a year.
∂09-Jan-85 2307 JMC more info
To: boyer@UTEXAS-20.ARPA
Can you supply a bit more, even if redundant with what you told me orally?
How long is the proof, both in the sense of how much the user typed
and how much text is there? How does the output compare with a conventional
proof in understandability? How long did it take? What are the publication
plans? Say again about the deBruijn representation of lambda expressions.
I don't really need all this, but there may be some interest and questions
after the talk.
∂09-Jan-85 2312 JMC
To: CLT
Do you want to put together the logic characters for TEX coalition?
∂09-Jan-85 2322 JMC special characters
To: SMC
We are making a list of all characters used in mathematics that are
missing from the TEX fonts and used here. Please send (on paper)
the ones you have noticed to Carolyn.
It will probably be quite a while before something systematic can be
done, so we'll still have to solve the problems of the present papers
in ad hoc ways.
∂10-Jan-85 0041 JMC burglar traps and watch dogs
To: su-bboards@SU-AI.ARPA
It would be interesting to understand how the illegality of
all kinds of burglar traps except one developed. It is apparently
legal to have a suitable confined fierce dog provided warning
is posted. Can a burglar bitten by a watch dog sue?
∂10-Jan-85 1736 JMC
To: RA
Consulting for MCC, but I bill them.
∂10-Jan-85 1957 JMC re: MCC's University Affiliates Program
To: HK.PLD@SU-FORSYTHE.ARPA
[In reply to message sent Thu, 10 Jan 85 17:46:49 PST.]
Please include me as a contact in the MCC University Affiliate program.
∂10-Jan-85 2001 JMC re: Supercomputing center
To: ullman@SU-AIMVAX.ARPA
[In reply to message sent Thu, 10 Jan 85 16:33:46 pst.]
I have no objection to Stanford participating in a supercomputer center.
It is in no way competitive with my parallel computing in Lisp project.
I don't want to be on a steering committee in order to avoid meetings,
but you're welcome to refer to my research interests.
∂10-Jan-85 2226 JMC re: Supercomputing center
To: ullman@SU-AIMVAX.ARPA
[In reply to message sent Thu, 10 Jan 85 22:17:38 pst.]
I suppose so.
∂10-Jan-85 2228 JMC blank transparencies
To: RA
I need about 20 more. Please put them in the paper box next to the
box with file folders in the bottom shelf of the middle bookcase agains
the wall closest to your office.
∂10-Jan-85 2306 JMC
To: ullman@SU-AIMVAX.ARPA
See you Monday or any other time next week.
∂12-Jan-85 1835 JMC
To: ME
ap, down for a day, was fixed by tty exist 16
∂12-Jan-85 2205 JMC re: Origin of the name of the days (question, not flame!) (from SAIL's BBOARD)
To: OTHER-SU-BBOARDS@SU-AI.ARPA
jmc - It is my impression that the use of the seven day week in China
and Japan is an import from the West. If this is so, then the names
of the days would probably have been formed by analogy with the
Western names. It seems to me I read about a Japanese ten day cycle.
∂13-Jan-85 1251 JMC con
To: faculty@SU-SCORE.ARPA
The Library's hours are too limited.
∂13-Jan-85 1531 JMC
To: nilsson@SU-SCORE.ARPA
CC: RPG@SU-AI.ARPA
I think consulting professors should be on the faculty@score mailing
list.
∂13-Jan-85 1525 RPG My appointment
Will this appointment mean that I will be able to discuss issues
with the faculty? In particular, I just saw that HP is thinking of giving
some 9836's to CSD, representing that they run Common Lisp. What they run
is a Common Lisp compatability package on top of PSL (though this might
change). Given this, they are of limited use to the department until they
are more fully Common Lisp. In particular, the Lisp will need to be made
lexical, both in the interpreter and compiler, before they do not cause
programmer madness.
I guess what I'm saying is that I'd like to be on the faculty mailing list.
-rpg-
∂13-Jan-85 1725 JMC
To: faculty@SU-SCORE.ARPA
n082 1708 13 Jan 85
BC-COMPUTE
Art enroute to Picture Service clients.
By GENE I. MAEROFF
c.1985 N.Y. Times News Service
BOSTON - Computer science, a field in which there was no major at
most colleges and universities before the 1970s, is fast becoming one
of the most popular majors as enrollments grow so rapidly that some
schools must limit admissions.
The situation is epitomized by events in Boston, where Northeastern
University created a College of Computer Science in 1982 with 230
students that now has an enrollment of 909. At the nearby
Massachusetts Institute of Technology, one-third of all
undergraduates with declared majors have chosen the department of
electrical engineering and computer science.
Computer science, with its lure of plentiful jobs and the
possibility of youthful entrepreneurship, is accounting for an ever
larger portion of enrollment at a time that overall enrollment is no
longer growing.
''These are young people who have been brought up on video games,
and there is a romance in computers for them,'' said Paul M.
Kalaghan, dean of the College of Computer Science at Northeastern.
''It is a chance to spend your life working with devices smarter than
you are and, yet, have control over them. It's like carrying a
six-gun on the old frontier.''
Computers have gradually made inroads on campuses since the 1960s as
aids in research and instruction and as tools for word processing.
What is happening now, though, is that increasingly more students are
preparing for careers devoted to computer science itself and for the
various allied technological fields.
The training equips students to land lucrative jobs in fields that
were virtually unknown only a couple of decades ago. Graduates can go
on to become systems analysts, who produce an overall design for
solving problems on a computer, or they can become systems
programmers, who write the set of instructions, called software, that
tells the computer how to carry out the tasks. Others become systems
applicators, who adapt the software for specific purposes, such as
making out a payroll.
Those students who also take some engineering courses can become
designers of circuits, controls and robotic devices.
''It seems like a field that if I decide not to stay in it all my
life can be a stepping stone to something else,'' said Raj Jain, a
sophomore at MIT from Holmdel, N.J. ''If you choose, you can have a
career in computer science without completing your degree and can
even work on your own without joining a company. Besides, it's a lot
of fun.''
The enrollment surge is taxing the resources of institutions as they
struggle to find money for expensive equipment and enough new faculty
members to keep up with the demand for courses for both students
majoring in the field and for non-majors who want computer literacy.
Moreover, educators are concerned that as curriculums are stretched
to include more computer courses, the trend away from the liberal
arts and toward early specialization is being accelerated.
Nevertheless, undergraduates continue to flock to computer science.
The number of computer science majors at the University of Oregon,
for example, has increased by 119 percent since 1979, to 566.
Two trailers are parked in a lot at the University of Pennsylvania,
in Philadelphia, to accommodate the overflow of students from the
computer science department until a new wing is added to the computer
building.
Computer science accounted for the fifth highest number of
bachelor's degrees granted at New York University in 1981, and by
last year the field was second highest, exceeded only by biology.
Princeton University voted last month to split its department of
electrical engineering and computer science, making computer science
the first department at Princeton to offer degrees in both
engineering and liberal arts.
Some students at City College of New York, which has 330
undergraduates majoring in computer science, as against 20 in history
and 15 in philosophy, must delay graduation because the faculty is
not large enough to give enough sections of all required courses.
The University of California, Berkeley, limits enrollments in
computer science and is being ''more selective than we would like to
be,'' according to Arthur M. Hopkin, a vice chairman of the
department.
Faculty members at MIT have authorized the department of electrical
engineering and computer science to restrict admissions. But the
plan, which is described as a last resort, has not been put into
effect.
For those who get into the department at MIT and major in computer
science there are four basic courses: structure and interpretation of
computer programs, computation structures, circuits and electronics,
and signals and systems.
The three courses required of upperclassmen are artificial
intelligence, laboratory in software engineering and automata, and
computability and complexity.
In addition, students take electives. Every student at MIT must take
a minimum of eight courses in the humanities and social sciences,
which usually means carrying at least one such course each semester.
While requirements vary at each college, all students pursuing
bachelor's degrees in computer science must have credits in such
courses as English, history and biology. nn
The rapid growth of the computer science college at Northeastern is
indicative of the national trend. The oldest structure on campus,
built in 1911 for automotive education, has been renovated and filled
with more wires than a toaster to accommodate the university's
youngest college. Eight professors from mathematics and engineering
were founding members of the computer science college's faculty,
which now numbers 23.
There were 1,200 applicants last year for the 300 places in
Northeastern's computer science college, and many seem to be drawn by
the prospect of sure employment and high salaries.
''Every time you pick up a paper you read of technology and hear of
someone who has made a million dollars out of it like the guy who
started Apple,'' said Kenneth J. Cohen, a senior from Stamford,
Conn., who is in the computer science major at Northeastern.
Often students are encouraged to pursue computer science by their
parents. Philip R. McCabe, admissions dean at Northeastern, counseled
a student last year who wanted to be a mathematics teacher but was
being pressured by her father to study computer science.
''I told her she should follow her personal interest, even if meant
becoming a teacher,'' McCabe said. ''The next day, her father called
and was very upset. Did I realize, he asked me, that I was telling
his daughter to pass up a starting salary of $30,000 for $11,000?''
Many students who in other times would have been among the best in
the liberal arts are opting for computer science.
''Now, the well-educated person doesn't speak four langauges, but
only one: Fortran,'' said A.E. Barnes, a history professor at
Carnegie-Mellon University in Pittsburgh, referring to the computer
language.
Advocates of the liberal arts think the rivalry with computer
science will intensify as the field continues to break from its
moorings in departments of mathematics and electrical engineering. .
The Council of Colleges of Arts and Sciences, made up of liberal arts
deans, has assailed the creation of the Computing Sciences
Accreditation Board, which will begin accrediting programs this year.
The liberal arts deans fear that universities will divert resources
to computer science to win accreditation.
Another worry at many universities is where to get the professors to
meet the demand for added computer science courses. Northeastern's
answer has been to turn to industry.
Cynthia A. Brown, a specialist in the problem-solving methods of
computers, left G.T.E. Laboratories for Northeastern because she
likes ''being my own boss'' and has hardly had to take a cut in her
$46,000 salary.
''We are hiring for computer science at salaries higher than those
paid to most professors already at the university,'' said Kenneth G.
Ryder, Northeastern's president. ''There are possible morale problems
in this, but academic life can't be isolated from the real world.''
nyt-01-13-85 2015est
***************
∂13-Jan-85 2119 JMC re: Request for comments: (Part 2) (from SAIL's BBOARD)
To: OTHER-SU-BBOARDS@SU-AI.ARPA
jmc - While the meaning of each clause in the Constitution was debated
in the Convention and records of these debates exist, the Second
Amendment was part of the package of ten added in order to overcome
some objections to the original Constitution that arose during
the ratification process. Does anyone know how these were put
forward and by whom, and what debates there were on wording?
∂14-Jan-85 1259 JMC
To: RA
please Scribe bukovs.1.
∂14-Jan-85 1345 JMC AAAI sponsorship and help with conference
To: AI.Woody@MCC.ARPA
CC: jenks.yktvmx.ibm@CSNET-RELAY.ARPA
David Jenks of IBM and David Chudnovsky of Columbia are trying to organize
a conference and show at Stanford on symbolic computation to follow the
International Conference of Mathmaticians in Berkeley in August 1986.
Neither AMS nor SIAM can sponsor it, being overloaded and for other
reasons, not all good. Besides algebraic computation, Jenks and
Chudnovsky's main interest, the conference would include theorem proving.
I agree with them that this is a major opportunity to bring the attention
of a large mathematical community to symbolic computation. I think AAAI
should agree to be the main sponsor, and Claudia should be asked to help
them to the extent feasible. They will have money to pay for services,
including hiring additional help, but the conference won't be a money
maker. Jenks will phone you in the next couple days or you can reach him
at 914 945-1233.
∂14-Jan-85 1843 JMC re: Course listing
To: BERG@SU-SCORE.ARPA
[In reply to message sent Mon 14 Jan 85 15:58:24-PST.]
I have no objection to the students' proposal.
∂14-Jan-85 1844 JMC letter
To: RA
Please SCRIBE ramo.1[let,jmc]. Comment out the paragraphs on
the second page, but leave them in the manuscript.
∂14-Jan-85 2149 JMC from the Britannica article Calendar
To: su-bboards@SU-AI.ARPA
Once the day is divided in parts, the next task is to gather numbers
of days into groups. Among primitve peoples, it was common to count moons
(months) rather than days, but later a shorter period than the month was
thought more convenient, and an interval between market days was adopted.
It varied widely. In West Africa some tribes used a four-day interval;
in central Asia five days was customary; the Assyrians adopted six days
and the Egyptians, ten days, wehereas the Babylonians attached particular
significance to the days of the lunation that were multiples of seven.
In ancient Rome there was a nundinae, or nine-day, period between
weekly markets, although because of the Roman method of inclusive
numeration a nundinae contained what would now be called eight days.
The seven-day week may owe its origin partly to the four
(approximately) seven-day phases of the Moon and partly to the
Babylonian belief in hebdomadism - the sacredness of the number seven -
which itself was probably related to the seven planets. Moreover, by
the 1st century BC the Jewish seven-day week seems to have become
adopted throughout the Roman world, and this exerted its due influence
on Christendom. The origin of the names of the days of the week
appears to be astrological and to ahve been derived from the Latin
or Scandinavian god whose hour started the day.
***
The surprising thing to me is that the Jewish week was adopted in
the 1st century BC.
∂15-Jan-85 0001 JMC re: backtracking
To: DEK
[In reply to message rcvd 14-Jan-85 20:25-PT.]
I haven't been able to identify a class of problems much beyond 8 queens
to which the move elimination method is clearly applicable. It gains
its power in that problem, because the pigeon-hole principle requires
that there be a queen in each rank and in each file. Therefore, the
elimination of squares can make certain moves inevitable and makes
possible further eliminations. If we were interested in enumerating
placings of seven queens on the eight-by-eight board, it wouldn't
be a powerful tool. Of course, it is even more powerful on a toroidal
board, since there must be a queen on each diagonal of each of two slopes.
I checked whether the method was ever useful in eight queens to
eliminate diagonals, but it never was. There were always more diagonals
left than queens remaining to be placed.
Thinking more generally, the applicability of the method requires
that we already have requirements that there be a move in each of
some predetermined set of places.
What characteristic of your VLSI problem makes the
elimination method promising?
∂15-Jan-85 0918 JMC
To: SMC
Los Altos Western Store called to say that your halter plate came in.
∂15-Jan-85 1207 JMC reply to message
To: RA
[In reply to message rcvd 15-Jan-85 11:55-PT.]
Ask the library to look up Ramo in Who's Who.
Also see boyer.rv1 for an NSF proposal review.
∂15-Jan-85 1925 JMC non-monotonic bibliography
To: perlis@MARYLAND.ARPA
Can you U.S. mail a copy of your bibliography on non-monotonic reasoning to
Charles Applebaum
Department of Mathematics and Statistics
Bowling Green State University
Bowling Green, Ohio 43403
and computer mail a copy to me.
∂15-Jan-85 1928 JMC re: Bibliography and writeup on nonmonotonic reasoning
To: cha@MITRE-BEDFORD.ARPA
[In reply to message sent Tuesday, 15 Jan 1985 22:18-EST.]
It just occurred to me that I could pass the buck on the bibliography
which was prepared by Don Perlis at the computer science department of
the university of Maryland. I mailed a request to send it to
PERLIS@MARYLAND. I'll U.S. Mail copies of my own two papers.
∂15-Jan-85 1929 JMC send papers
To: RA
Please send copies of my two papers on circumscription to
Charles Applebaum
Department of Mathematics and Statistics
Bowling Green State University
Bowling Green, Ohio 43403
∂16-Jan-85 1757 JMC please look
To: RA
on my desk or thereabouts for a reply from some Stanford bureaucrat
to my complaints about noise on campus.
∂16-Jan-85 1933 JMC re: AAAI Executive Council Minutes
To: FIKES@USC-ECL.ARPA, aaai-office@SUMEX-AIM.ARPA
[In reply to message sent Sun 13 Jan 85 10:48:05-PST.]
There is, after all, one thing about the minutes that surprises me.
Can the Executive Council extend the term of the President without
a vote of the membership? Perhaps what we voted unanimously to do
was to propose this to the membership.
∂16-Jan-85 2032 JMC new generation systems?
To: Bernard←Galler%UMich-MTS.Mailnet@MIT-MULTICS.ARPA
You have this listed as my topic. I don't even know
what you mean by it. Do you want a general futuristic talk?
More technically I could talk about non-monotonic reasoning
or about common sense reasoning or about implementation of Lisp
on parallel processors.
∂16-Jan-85 2308 JMC re: Corrections in the annotation
To: CL.SHANKAR@UTEXAS-20.ARPA
[In reply to message sent Wed 16 Jan 85 23:28:29-CST.]
Thanks for the material on your proof - both messages.
∂17-Jan-85 1055 JMC re: HPP Architecture Meeting, Wed. 1/23., 9 am
To: DAVIES@SUMEX-AIM.ARPA
CC: feigenbaum@SUMEX-AIM.ARPA
[In reply to message sent Thu, 17 Jan 1985 01:12 PST.]
I can't come next Wednesday or the following Wednesday. However, I could
come any other morning next week. Is that possible?
∂17-Jan-85 1056 JMC re: Joe Halpern
To: ARK@SU-SCORE.ARPA
[In reply to message sent Thu 17 Jan 85 02:35:57-PST.]
Halpern will be fine.
∂17-Jan-85 1059 JMC re: AAAI Executive Council Minutes
To: FIKES@USC-ECL.ARPA
[In reply to message sent Thu 17 Jan 85 10:06:27-PST.]
The truth is that I have forgotten what workshops there were. No doubt
Claudia has a list. There were about five all together, but most hadn't
occurred by the time of the meeting.
∂17-Jan-85 1103 Mailer failed mail returned
To: JMC
In processing the following command:
MAIL
The following message was aborted because of a command error,
namely, nonexistent recipient(s):
Bernard
------- Begin undelivered message: -------
∂17-Jan-85 1103 JMC ←Galler%UMich-MTS.Mailnet@MIT-MULTICS.ARPA
re: new generation systems?
[In reply to message sent Thu, 17 Jan 85 12:27:26 EST.]
I am not in a position to speak on the main U.S. projects, e.g. DARPA's
Strategic Computing Project. I can speak only about a small project
to put Lisp on parallel systems that DARPA may not even have funded by
that time. I'd much rather talk about "Programs with Common Sense",
although I can do the Lisp talk. Perhaps you really want someone else?
------- End undelivered message -------
∂17-Jan-85 1108 JMC re: new generation systems?
To: Bernard←Galler%UMich-MTS.Mailnet@MIT-MULTICS.ARPA
[In reply to message sent Thu, 17 Jan 85 12:27:26 EST.]
I am not in a position to speak on the main U.S. projects, e.g. DARPA's
Strategic Computing Project. I can speak only about a small project
to put Lisp on parallel systems that DARPA may not even have funded by
that time. I'd much rather talk about "Programs with Common Sense",
although I can do the Lisp talk. Perhaps you really want someone else?
∂17-Jan-85 1232 JMC
To: nilsson@SU-SCORE.ARPA
Goad,Chris (home: 857-9674) (New Mexico: 505-455-2464) (sil: 493-0145)
Silma
∂17-Jan-85 1235 JMC
To: RPG
Who is this Dave Fink?
∂17-Jan-85 1903 JMC
To: RA
2 hours consulting bill to MAD. No other charges.
∂17-Jan-85 2345 JMC reply to message
To: RPG
[In reply to message rcvd 17-Jan-85 21:31-PT.]
I was very perfunctory with Fink. I told him we expect to be making up
our minds within the next month.
∂18-Jan-85 1028 JMC
To: YOM
I need your summary today.
∂18-Jan-85 1838 JMC
To: JJW
How about a paragraph tonight for DARPA on your activities.
∂18-Jan-85 2153 JMC
To: JJW
Your paragraph is ok.
∂18-Jan-85 2320 JMC
To: ohlander@USC-ISI.ARPA
report[f84,jmc] To DARPA about recent work
Ron:
Sorry this took so long. It can be modified if its format
is unsuitable.
FORMAL REASONING AND COMMON LISP
The formal reasoning group during 1984 included Professor John
McCarthy, Drs. Richard P. Gabriel, Paul Wieneke and Carolyn Talcott,
Professor Vladimir Lifschitz during the summer, Joseph Weening, and
Yoram Moses.
McCarthy and Lifschitz worked on non-monotonic reasoning. Gabriel
and Wieneke worked on Common Lisp and parallel Lisp. McCarthy worked
on parallel Lisp also. Carolyn Talcott worked on the foundations of
Lisp-like programming languages. Weening worked on parallel execution
of Lisp. Moses worked on the relation of knowledge and computation.
The work on these subjects is described in the following sections.
1. NON-MONOTONIC REASONING APPLIED TO COMMON SENSE
John McCarthy and Vladimir Lifschitz
McCarthy's main work has been continuing research on non-monotonic
reasoning and its application to artificial intelligence.
(McCarthy 1980) describes the original work resulting in the circumscription
method of non-monotonic reasoning, and (McCarthy 1984) gives
an improved method and applies it to formalizing common sense knowledge.
While the details are in these documents here is a summary.
An intelligent system, e.g. and intelligent robot, must somehow
express what it knows about the world --- about the relation between
the appearances it senses and the actual state of its environment,
about how the effects of actions and events depend on the situation
in which they occur, and about its own knowledge or lack thereof and
the location of knowledge in other intelligences as well as in documents
and computer files. There are four used and proposed vehicles for expressing
this knowledge --- natural language, procedures, ad hoc data structures
whose meaning resides in how they are interpreted by program, and
the languages of mathematical logic.
While many have advocated it
from time to time, natural language has not been used as a vehicle
for expressing general knowledge. Partly this because much basic
human knowledge about the effects of physical actions and how
to interpret observations is not expressed linguistically, i.e.
people can't tell you how they do it, and no-one has ever tried
to write it down. Besides this, however, rules of inference
for natural language have never been formulated and may not
even exist.
Most AI program combine building knowledge into program,
i.e. expressing it procedurally, and representing it in ad hoc
data structures that are used by the programs. This works, but
has always to led to systems of limited capability that have
to be rewritten when major expansions are wanted. Knowledge
expressed as procedures is not easily obtained by a program for
itself. This knowledge is almost always built in by the programmer.
When systems of this kind are generalized, they become more and
more like logic based systems.
Mixed systems are increasingly common. One kind of mixture
interprets logical expressions procedurally as in Prolog. Another
kind represents information by logical expressions but gets new
expressions from old ones by ad hoc procedures rather than by
logical deduction. Both of these methods achieve solve particular
problems at the cost of specialization.
Using logic directly was proposed in (McCarthy 1960), but
perhaps the idea can be considered to go back to Leibniz. He
proposed that there be a logical language and that argument
be replaced by calculation in human affairs. He was unsuccessful
in devising a logical language, not even getting as far as propositional
calculus which had to wait for George Boole, 150 years later. We
skip the further history of logic, although it is interesting and even important
for understanding where we are today.
(McCarthy 1960) proposed a program that would use common
sense knowledge expressed in mathematical logic sentences to decide
what actions would achieve the system's goals. Many attempts have
been made by different people to carry out this plan, but they have
up to now been forced to compromise generality in order to get
programs that solve particular classes of problems.
Formalized non-monotonic reasoning was first proposed in
the late 1970s in several forms by several people including McCarthy.
Logic is monotonic in the sense that a conclusion drawn from
a collection of premisses will still follow when the set of
premisses is extended by adding more sentences. Humans often
draw conclusions that must be taken back when more facts are
obtained. While this has been recognized for a long time, it wasn't
realized that such non-monotonic reasoning could benefit from
mathematical logical formalization or even that such formalization
was possible. Formalization makes it possible for computers to
use non-monotonic reasoning and for AI researchers to design
systems that do it in a systematic way.
(McCarthy 1984) applies a new version of the circumscription
method to handling inheritance hierarchies with exceptions and
to solving the frame problem that afflicts planning systems.
McCarthy, John (1960): "Programs with Common Sense," in Proceedings of the
Teddington Conference on the Mechanization of Thought Processes, Her Majesty's
Stationery Office, London.
McCarthy, John (1980):
"Circumscription - A Form of Non-Monotonic Reasoning", Artificial
Intelligence, Volume 13, Numbers 1,2, April.
McCarthy, John (1984):
"Applications of Circumscription to Formalizing Common Sense Knowledge".
This is has been accepted by the 1984 AAAI
conference on non-monotonic reasoning, which will not have a proceedings
and is being submitted for publication to Artificial Intelligence.
Vladimir Lifschitz studied the mathematical properties of
circumscription. He proved metamathematical results that can be sometimes
used for expressing the result of circumscription by first order formulas
and gave an interpretation of the unique names hypothesis in terms of
circumscription. These results are discussed in his paper, "Some Results
on Circumscription", presebted at the Non-Monotonic Reasoning Workshop in
New Paltz, October 17-19, 1984.
2. COMMON LISP AND QLAMBDA
Richard Gabriel, Paul Wieneke and John McCarthy
Qlambda
: Overview
The Qlambda project was undertaken as part of the Common Lisp work at Stanford
and also as part of the feasibility study for the Advanced Architectures
Project at HPP. It's goal is to extend Common Lisp by adding parallel processing
constructs.
: Objectives
Qlambda is an extension of Common Lisp which provides multi-processing
capabilities. Qlambda supports a variety of parallel programming styles,
including parallel argument evaluation and message-passing. It is designed
to be implementable on a variety of multi-processor architectures.
: Approach
The approach has been to write a detailed simulator for Qlambda to
simulate behavior of Qlambda programs on a multi-cpu, shared-address-space
computer. With this simulator it has been possible to write a number
of programs in Qlambda and explore the speedups attainable under varying machine
characteristic parameters.
: Current Status
The basic Qlambda extensions have been defined and are available in the
report ``Queue-based Multi-processing Lisp,'' by Richard P. Gabriel and
John McCarthy, available as a Stanford University Computer Science Report.
The simulator runs in MacLisp under TOPS-20 and in Common Lisp on the
Symbolics 3600.
Several programming techniques have been defined and demonstrated in Qlambda.
These techniques will be described later.
: Important Contributions
The most important contributions of the Qlambda project have been to define
parallel programming techniques. There have been two major techniques
explored: software pipelining and geometric control structures.
Software pipelining is breaking a serial program into stages and mounting
the stages on different processors. The technique includes mechanisms for
maintaining global variables among the stages. That is, if the original
program contained global variables which were used to pass information
between subsequent calls to the program, it is still possible to pipeline the
program and achieve a significant speedup. This technique is useful for
parallelizing globally-shared data structures by streaming update and
access requests through the code which maintains the data structures
in question.
Geometric control structures are a technique for matching the `architecture'
of a problem solution to the architecture of the underlying machine.
Suppose that the problem solution calls for a hexagonal grid of processors
where each processor talks to six neighbors. A geometric control structure
is a hexagonal data structure where each node in the data structure is a
process (rather than a processor), and processes communicate with
other processes along the data-structure-defined paths to its six neighbors.
If a data structure containing processes can be mapped onto a physical
multi-processor so that the lines of communication defined by the data
structure map onto lines of communication defined by the architecture,
then the running speed of the solution program will be good. And even on
general multi-processors which do not match the data structure well there
will usually be significant speedup.
We sometimes refer to geometric control structures as `soft architectures.'
The key idea behind this technique is that it allows the programmer to
solve his problem in an architecture well-suited to his problem and its
solution.
Portable Common Lisp
: Overview
This project is to provide a portable Common Lisp implementation available
to DARPA contractors. The key to the project is to develop a high-quality
Lisp compiler which can be ported easily to various machines. Because
Common Lisp is the prefered Lisp for Strategic Computing work, the availability
of Common Lisp on a variety of machines is essential.
: Objectives
The first objective of the project is a Common Lisp compiler. This compiler
is to be largely table-driven or to have relatively small parts that are
machine-dependent. The second objective is to provide a Lisp-in-Lisp-style
Lisp implementation, which is then compiled on the various machines.
In addition, there is a corpus of code written in Common Lisp, which could
be useful to several projects, and which exists at particular sites. A second
goal of this work is to create a library of such useful programs along with
good documentation.
: Approach
The approach is to start with the ideas in the S-1 Lisp, especially the compiler,
and to build a subset of Common Lisp for the SUN II workstation. This is a
popular and fairly powerful workstation. The subset is to be small enough to
run well on a SUN workstation with a small physical memory and perhaps a small
available address space. That is, the implementation is geared towards being
usable on a mobile robot with a small MC68000-based machine on-board.
There is a problem with this approach, which is that there remains a significant
amount of machine-dependent code to be written on each port, even though the
its fraction of the total amount of code in the implementation is quite small.
: Current Status
Currently there is a subset of Common Lisp that runs on the SUN II under the
V kernel, a Stanford operating system similar to Unix. The code is available
on magnetic tape, and several copies have been sent to various institutions.
3. FOUNDATIONS OF LISP-LIKE PROGRAMMING LANGUAGES
Carolyn Talcott
Talcott has continued work on Rum, which a theory of
intensional and extensional aspects of the
side-effect free fragment of Lisp-type symbolic computation.
The goals of this work include obtaining a better understanding
of the mathematical properties of computations that can create
and apply higher type objects. In Rum there are two classes
of higher type object: pfns, which are descriptions of partial functions
and continuations, which describe
how a computation is to continue when the current subcomputation returns a
value.
Pfns are analogs to closures as introduced by Landin [1] and implemented in
Scheme [3].
Continuations are analogs to the J operator of Landin [2] and to the continuations
bound by the CATCH construct of Scheme.
In addition to pfns and continuations, the basic model includes forms and
environments. Forms are symbolic expressions describing computations
and environments are finite maps which assign values to free symbols in forms.
Computation trees and sequences give the structure of computations
described by forms. These structures provide the basis for expressing
intensional properties of programs - such as counting the number of
conses, counting the number of pfn applications, or measuring the
maximal stack depth required. They also serve as the
basis for program transformations that map a program into one that
computes some property of the computation it describes -
thus transforming intensional properties of one program into extensional
properties of another.
Evalutation and subcomputation are derived from the computation structures
and provide the basis for treating extensional aspects - properites
of the ``function computed'' by a program.
The main results are:
() Two basic theorems about the computation relations
are the recursion theorem and a computation induction theorem.
The recursion theorem gives a recursion pfn that computes
a fixed point of pfns that compute functionals and thus provides
a means of definition by recursion. Computation induction
expresses the fact that for computations which return a value,
the sub-computation relation is well-founded.
() A notion of comparison relation is introduced for tree \RUM! that includes
include both approximation relations (with respect to definedness)
and equivalence relations.
Each comparison relation corresponds to forgetting selected details of computation,
while preserving the evaluation and application structure.
Methods are developed for construction of comparison relations
and for proving properties of particular comparisons.
There is a maximal approximation relation, Xlt. The intersection
of this relation with its inverse, Xeq is the maximal equivalence relation.
Two key theorems about these relations are (i) Xlt and Xeq are
extensional and (ii) the recursion pfn computes the least
fixed point with respect to Xlt. Extensionality of Xlt means
that for any pair of pfns,
p0 and p1, p0 approximates p1 iff p0 applied to any
to any argument v approximates p1 applied to v.
Thus pfns describe partial functions on Xeq-equivalence
classes of the computation domain, and two pfns are equivalent
iff they describe the same partial function.
There is a rich hierarchy
of comparisons between equality and the maximal relations.
For example, forms related by distribution of application
over conditional
f(if(p(x),x,y)) R if(p(x),f(x),f(y))
and by distribution of conditional over conditional
if(if(p(x),q(x),r(x)),g(x),h(x)) R if(p(x),if(q(x),f(x),g(x)),if(r(x),f(x),g(x)))
give rise to equivalences
where related forms describe computation trees
with the same number of nodes of each sort, but
different subcomputation structures.
The theory of comparison relations provides concepts and tools
useful in developing a theory of program specifications and
transformations.
() Notions of Rum machine structure and morphism are introduced.
A machine structure has states and a step relation, with states naturally
generated from a class of symbolic descriptions.
A morphism, M maps states s of the source machine A
to states M(s) of the target machine B in a manner that carries
the step relation Step{A} of the source machine to steps Step{B} of the
target machine. That is,
s0 Step{A} s1 iff M(s0) Step{B} M(s1)
Rum computation has a natural machine structure RM.
A machine structure is defined on the tree fragment based on
sequential descriptions whose computaton trees
have a single main branch such that the value of the computation
is the value at the leaf of the main branch.
The main theorem is the existence of a compiling morphism
from RM to this sequential fragment.
This morphism serves as a paradigm for compiling and for proving properties of
compilers. It makes precise the relation between closures and continuations
and corresponds to the normal form theorem of
recursion theory.
() Working in Rum, a variety of examples are given
to illustrate its potential applications and to demonstrate the
adequacy of the theory. In particular we formulate and prove
the correctness of the following programs
-- a pattern matcher that uses closures to implement
backtracking in a search for all matches of an object to a pattern
-- a program that uses continuations in order
to avoid unnecessary work in computing products represented as trees
with numbers at the leaves. If a zero is encountered
it is returned directly to the caller
rather than passing the information back in the normal fashion
to be rechecked at every level.
This corresponds to the use of Catch and Throw in Lisp.
References:
[1]
Landin,P.J.[1964]
The Mechanical Evaluation of Expressions
Computer Journal 6
pp. 308-320
[2]
Landin,P.J.[1965]
A Correspondence Between ALGOL60 and Church's Lambda Notation
CACM 8
pp. 89-101, 158-165.
[3]
Steele, G.L., Sussman, G.J.[1975]
SCHEME, and Interpreter for Extended Lambda Calculus,
MIT AI Memo 349 (December 1975)
4. PARALLEL EXECUTION OF LISP PROGRAMS
Joseph Weening
Weening is pursuing his dissertation work in the study of parallel execution
of Lisp programs. This includes a study of machine architectural features
appropriate for symbolic programming, as well as the problem of extracting
parallelism from sequentially-presented Lisp programs. The queue-based
approach, in which assignment of processors to processes is decided as the
program is running, is assumed.
Architectural considerations take place in deciding how to efficiently
implement the basic constructs of Qlambda [1] or other dialects of parallel
Lisp, such as Multilisp [2]. Appropriate primitives provided in hardware
can greatly improve the performance of process waiting and access to shared
variables, which are essential activities in the queue-based approach. The
Denelcor HEP [3] is an example of an architecture which provides the basis
for efficient process management. (Other features of the HEP, such as its
read-only local program memory, make the implementation of Lisp somewhat
problematic.)
Extraction of parallelism involves studying the potential side effects of
a program, and deciding which parts may safely be executed on separate
processors without affecting the program's results. Once this is done,
there remains the problem of deciding when it is actually beneficial to
execute part of a program in parallel.
[1] Gabriel, R.P., McCarthy, J., "Queue-based Multi-processing Lisp", 1984
ACM Symposium on Lisp and Functional Programming.
[2] Halstead, R.H., "Implementation of Multilisp: Lisp on a Multiprocessor",
1984 ACM Symposium on Lisp and Functional Programming.
[3] Smith, B.J., "A Pipelined, Shared Resource MIMD Computer", Proceedings
of the International Conference on Parallel Processors, 1978.
5. THE RELATION BETWEEN KNOWLEDGE AND COMPUTING
Yoram Moses
Yoram Moses is currently investigating the relationship between knowledge
and computing. A previous work of his under this grant, dealing with
representation schemes and the expressibility of first order logic
has just appeared in press as a paper titled ``On the encoding of
relations by graphs'', in the SIAM Journal of Algebraic and Discrete
methods, Vol. 5, No. 4, December 1984.
In his current work on knowledge, Moses is investigating both the
formal aspects involved in developing Logics of Knowledge and
Ignorance, and the less formal aspects of the relationship between
knowledge and action in Artificial Intelligence and distributed
computing. He is trying to characterize what states of knowledge are
necessary for successfull cooperation of intelligent agents, and
relating that to an analysis of what states of knowledge are
practically attainable in communication between robots or computers
in general. Among other things, this work suggests that a theory of
knowledge generalizing the well known theory of information is needed
as an appropriate framework in which to address the problems of
cooperation in a society of intelligent agents, or in a distributed
system. The following paragraphs briefly outline the work done in a
number of papers Moses is currently writing, or has published in
conferences and workshops.
The paper ``Knowledge and common knowledge in distributed environments''
presents a number of well known puzzles regarding agents' actions in
a situations in which there is interdependence between their actions.
A hierarchy of states of knowledge that a group may be in is defined,
and we describe how the state of knowledge called ``common knowledge''
is a necessary precondition for the ssccessful solution of these puzzles.
It is then shown that common knowledge is an inherent part of agreements,
and a necessary part of certain cases of coordinated action. We show
that if the communication channels between agents are imperfect, in the
sense that messages are not guaranteed to be delivered, or in the sense
that there is a doubt as to precisely messages are delivered, common
knowedge cannot truly be attained. In practice, literally all channels
of communication are imperfect in one of these senses.
We define a variety of approximations to the notion of common knowledge,
and discuss the extent and conditions fr them to act as ``worthy
substitutes'' for common knowledge in distributed action. This paper
appeared in the 3rd Annual Symposium on the Principles of Distributed
Computing, held in Vancouver in August 1984, and has generated interest
both in the distributed computing field and in the AI.
This paper is joint with Joe Halpern of IBM San Jose.
A preliminary version of the paper ``Towards a theory of knowledge and
ignorance'' was presented at the AAAI Workshop on Nonmonotonic Logic
in New York in October 1984. It deals with the basic question of how
an intelligent agent that is fully aware of the facts in his knowledge
base can determine what facts he is ignorant of. Another way of stating
this is determining what ``knowing only p'' for a single formula p
representing the information in the agent's knowledge base means.
This problem has been identified by McCarthy and others as a fundamental
question in the logic of knowledge. Konolige [1] and Moore [2] treat related
problems. A major problem in this work is demonstrating that a solution
you come up with is in fact the right one. We take four different
approaches to the solution: some ssmantically based, some syntatctically
based, one an algorithm that solves the problem. In each one we find that
there seems to be a natural solution for some well behaved ``honest''
formulas, but there are problematic formulas for which no such solution
exists. We show that the classes of problematic formulas in all cases
coincide, and that for an ``honest'' formula, all approaches give us the
same answer. Thus, we have a robust notion of what ``knowing only p''
means. We also argue that ``dishonest'' formulas cannot truly represent
all the information in a knowledge base. This work deals with the
propositional modal logic of a single knower. We are in the process of
extending it to the interesting case of mny knowers, and hope to solve
the first order case too. This work is also joint with Joe Halpern of
IBM San Jose.
The paper ``A guide to the modal logics of knowledge and belief'' is an
introduction to the formal aspects of its subject. It describes how
possible-worlds semantics capture the notion of knowledge and belief,
introduces the reader to the notion of Kripke structures as a possible-worlds
formalism, and proves some of the basic well known properties of the
resulting models for knowledge and belief. It then goes on to present
efficient decision procedures for a variety of logics of knowledge,
generalizing some results of Ladner [3], and proving some new results.
The result is contrary to prevalent opinions in some circles, that claim
that the modal approach to logics of knowledge is computationally
intractable. This work, too, is joint with Joe Halpern.
In the well known ``cheating wives'' puzzle, there is subtle interaction
between agents' knwoledge and their actions. The puzzle opens with a
``public'' statement that makes a number of facts common knowledge.
Artificial agents communicate via signals and messages, and it is not
aways possible to perform ``public announcements'' in that setting.
The paper ``Cheating husbands and other stories: a case analysis of
knowledge and action'', in preparation, is an analysis of how the states
of knowledge arising from different modes of communication affect the
success of the actions taken by intelligent agents in a society.
Essentially, we look at variants of the cheating wives puzzle in which
the announcement is delivered by a messenger rather than via a public
announcement. Surprisingly, in many cases this denies the possibility
of a successful solution to the puzzle. This work is joint with Danny
Dolev of the Hebrew University, and with Joe Halpern from IBM San Jose.
The paper ``Knowledge and common knowledge in Byzantine environments''
is a sequel to the ``distributed environments'' paper mentioned above.
It deals with the characterization of the facts that can possibly
become known in different modes of communication, and deals with the
interesting case of characterizing the states of knowledge arising
from messages that are received in societies that include faulty agents,
liars etc. By proving a general theorem about the conditions required
for obtaining common knowledge in such circumstances, we generalize
a large number of known lower bounds, and demonstrate that the basic
reason for them is in the inherent uncertainties in information
distributed amongst agents that are potential liars.
This paper is in preparation, and is joint with Cynthia Dwork of MIT.
References
\item{HM1} J.\ Y.\ Halpern and Y.\ Moses, Knowledge and common knowledge in
a distributed environment, {\it Proceedings of the 3rd ACM
Symposium on Principles of Distributed Computing}, 1984, pp.\ 50--61.
\item{HM2} J.\ Y.\ Halpern and Y.\ Moses, A guide to modal logics of knowledge,
to appear as an IBM RJ, 1984.
[1] K. Konolige, Circumscriptive ignorance,
Conference Proceedings of AAAI--82, pp. 202--204.
[2] R. C. Moore, Semantical considerations on nonmonotonic logic,
SRI International Technical Note 284, 1983.
[3] R. E. Ladner, The computational complexity of provability in
systems of modal propositional logic,
Siam J. Computing, Vol. 6, No. 3, 1977, pp. 467--480.
∂19-Jan-85 0058 JMC council
To: aaai-office@SUMEX-AIM.ARPA
Please MAIL me a list of past and present members of the Council to help
me suggest nominees.
∂19-Jan-85 0135 JMC
To: llw@S1-A.ARPA
Still no word from DOE.
∂20-Jan-85 1518 JMC techpsych anyone?
To: su-bboards@SU-AI.ARPA
jmc - There is a large amount of self-important puffery among the
author and the promoters of techpsych. However, there may be a few
useful results.
n055 1338 20 Jan 85
BC-COMPUTER Undated 3takes
(Financial)
Peggy Schmidt is working on a book about the impact of technology on
people and their jobs.
By PEGGY SCHMIDT
c.1985 N.Y. Times News Service
According to the International Data Corp. market researchers, nearly
12 million personal computers, terminals and word processors have
made it into offices across the country. And they are being cursed as
often as blessed. Users complain of eye strain and mental stress.
Managers question whether electronic messages are being used to the
detriment of personal interaction.
Clearly, the growing computerization of the work force has brought
its own form of trauma. The machines can record every key stroke and
can spew forth productivity reports with the press of a button,
giving rise to workers' complaints that Big Brother is watching. They
can make some tasks so simple and repetitive that the boredom factor
negates any productivity gains that the task simplification might
have yielded. And computers can cause deep insecurity for workers who
simply do not catch on to their use as quickly as their peers appear
to.
Late last year, an international symposium entitled ''Ancient Humans
in Tomorrow's Electronic World,'' held at the Aspen Institute for
Humanistic Studies, addressed the question of whether human beings
have the biological and social capabilities to adapt to the advanced
technological environment they are creating. The answer was yes - but
they need help.
That help is starting to come, from a new field that is colloquially
referred to as ''tech psych.'' The practitioners of this new
discipline can be psychologists, anthropologists, linguists, computer
scientists, sociologists - or better still, some combination of the
above. They are attracted to the field because it represents fertile
ground for studying from a new perspective how humans think, behave
and communicate.
Indeed, tech psychologists have twofold jobs. They identify
computer-caused problems in an office and offer solutions. And they
study how the computers are used in order to develop new theories
about the ways people think, with hopes of incorporating those
theories into the design of newer generations of computers.
Tech psychologists can be found on quite disparate payrolls. Many
are employed by universities. Others have embarked on projects for
unions that want to identify those computer-related health, safety,
job security and quality-of-worklife issues that can be addressed in
bargaining sessions. And quite a few are employed by computer
manufacturers and software writers themselves. ''Ease of use is a
major concern now that managers and professionals with no computer
experience have adopted personal computers,'' said Susan Dray,
manager of human technology impacts at Honeywell Inc. Added Thomas
Moran, manager of user-system research at the Xerox Corp.'s Research
Center in Palo Alto, Calif., ''We're trying to make machines smarter
by studying the way people think.''
The government, too, is getting into the act. Federal agencies such
as the National Science Foundation and the National Institute of
Occupational Safety and Health, have financed research. And the
Office of Technology Assessment, an advisory group to Congress, is
trying to identify issues in office automation that Congress may want
to consider.
Tech psych is, in some respects, an offspring of the more
established field of ergonomics, or the study of human factors.
Ergonomists have worked in the microelectronics industry for years,
solving such ''knobs and dials'' problems as the placement of keys,
the brightness and color of screens and displays, and the location of
disk drives.
But until recently, their primary goal was to design systems that
would be most efficient to use. Nowadays they are increasingly
looking for ways to build in features that not only make the systems
easier to use, but also more psychologically acceptable to users.
For example, while lower-level employees using computers are more
likely to worry about the invasion of privacy that comes with the
computer's ability to monitor their performance, managers and
professionals are more concerned about accessability to the computer
data itself. For example, many are reluctant to use internal
electronic mail systems - systems that allow people to send and
receive messages via computer - because it seems too easy for anyone
with access to the computer to peak at someone else's messages.
It was practitioners of tech psychology who suggested features that
allow users to ''lock up'' files that contain personal messages, or
to scramble messages. ''If a particular type of office technology
isn't used because it violates personal freedom or flies in the face
of corporate custom, it's just as important as a product failing for
engineering reasons,'' said Susan Dray, the Honeywell manager.
Those tech psychologists who are interested in more esoteric studies
are using computers to discern how people actually organize their
thoughts - in hopes of then using that data to write software that
will in turn let computers help them with that organization.
Moran of Xerox, for example, says that most people compose written
text by collecting ideas, committing them to memory or jotting them
down on paper, then forming them into a ''shoebox of mental or real
note cards,'' all of which are related to one another.The person then
sorts through the ideas to decide
which ones to use, the order in which they should be presented, and
how to express the relationships among them.
In his current work, Moran says, ''We use text processing and data
management programs to help us quantify and measure the steps of the
composing process. But our findings may also eventually be used to
design sophisticated computer software that might help the person who
is formulating a written argument, for example, to construct a
framework for it, point out its weaknesses and advise him to check
certain sources.''
''When people are introduced to computers, many of them experience
the same alienation that people who move to foreign countries do,''
said Sara Kiesler, a professor of social psychology at
Carnegie-Mellon University. And like many foreign visitors, she said,
computer neophytes are put at ease when they run into people from
their own backgrounds.
Thus, Professor Kiesler and other tech psychologists are urging
companies to put computer training into the hands of peers who have
undergone prior training, rather than hiring professional trainers or
sending would-be computer users back to school.
''If there's an overlap in the values of the teacher and the
student, it's less of a we-they type of relationship,'' explains
Professor Kiesler. ''That argues for secretaries training other
secretaries and managers training other managers.''
However, adds Bonnie Johnson, a psychologist and office systems
planner at the Intel Corp., such informal training must take place
within a corporate culture that stresses learning. It will not work,
she warns, ''unless a company makes continuous training available to
employees and learning is given priority status by high-level
management.''
If those two conditions do exist, the amount of training, both
formal and informal, will tend to have a snowballing effect. Miss
Johnson tells of an Intel manager who spurned the personal computer
the company gave him, preferring to do his financial spreadsheets and
memos by hand. His secretary then transferred the data onto the
computer.
Although the manager claimed that he simply did not want to use the
computer, he actually was frightened that he would not be able to
absorb the new technology. Then he noticed that he was virtually the
only one in the department who was not actively using the computer -
and his reaction, as Miss Johnson recalls it, was if his peers could
learn it, he could, too.
Even as some tech psychologists study the impact of peer pressure on
the spread of computer use, others study the exact reverse - that is,
the impact of computers on interoffice relations. The growing use of
electronic mail and computer conferencing, in which people ''meet''
by writing messages on computer terminals that automatically appear
on other people's terminals, has attracted any number of researchers.
''Gathering and dispersing information is the lifeblood of any
organization, which is what makes this topic so attractive,'' said
Susan Dray, the Honeywell manager of human technology impacts.
One recent experiment, conducted by Professor Kiesler and several
Carnegie Mellon colleagues, turned up some rather surprising results
on the ways in which computers affect communications. Several
university administrators and managers from Pittsburgh companies were
put into groups of three, and asked to make such decisions as
choosing between two capital investments, one of which would deliver
a small but certain return, the other of which was a gamble that
offered a higher potential win.
On half the problems, the groups were asked to use computers to
communicate; on the other half, they relied on conventional face to
face conversation. The researchers found that when they used the
computers, the participants used fewer words to discuss their points.
And they were less swayed by the idea of standing alone against the
other two people in the group. ''Social cues - tone of voice and
facial expressions - are absent,'' said Professor Kiesler. ''People
are more likely to make independent choices.''
Ten years ago, Marilyn Mantei, then a recent college graduate,
wanted to take a graduate program in human-computer interaction. She
looked through countless university catalogues, yet could not find
one that offered such a course of study.
Today Miss Mantei, who is an assistant professor of computer and
information systems at the University of Michigan's Graduate School
of Business Administration, counts more than 50 schools offering
doctorates in psychology, computer science or business, with an
emphasis on human-computer interaction, as tech psych is formally
called. What is more, she claims that the computer industry snaps the
graduates up as quickly as the schools spew them out. ''The demand
for Ph.D.s with psychology research skills who understand how
computer systems are designed is enormous,'' she said.
Indeed, tech psychology's evolutionary path in education is
mirroring the path that computer science itself took. Not that long
ago, computer studies were offered only as a sub-discipline in the
mathematics or electrical engineering departments. Nowadays computer
science is a stand-alone specialty at hosts of schools.
As of now, there are no undergraduate programs in tech psych
available. Most candidates for a doctorate with an emphasis in
human-computer interaction come with at least a rudimentary knowledge
of computer programming. And as part of their doctoral studies they
will take courses in psychology - both traditional and
business-oriented - as well as a sprinking of courses in ergonomics,
the study of human factors. The tech psych concentration normally
takes five to six years to achieve, and requires extensive field work
or lab research.
The graduates wind up in various types of jobs. Those who are
skilled in computer science as well as in computer-human interaction
often do product design for hardware and software manufacturers.
Those who have stuck primarily to psychology also find a home with
the computer companies, generally doing research on user needs. And
graduates whose advanced degree was in the business area often help
companies that are computerizing to design systems and integrate them
into the offices.
Academia has not yet formally acknowledged human-computer
interaction as a discipline worthy of its own full-blown doctorate,
but both the Human Factors Society, an association made up primarily
of psychologists, and the Association of Computing Machinery, a group
made up primarily of computer scientists, have given it a measure of
formal professional status. Both have formed sub-groups for members
with a special interest in human computer interaction. And those
members, insists Lorraine Borman, chairman of that Computing
Machinery Association's sub-group, already are making a major mark in
industry. ''The best evidence of that,'' she said, ''is the number of
companies who are naming our members heads of newly-created
departments that have human-computer interaction as their main
focus.''
∂20-Jan-85 1520 JMC reply to message
To: RESTIVO@SU-SCORE.ARPA
[In reply to message sent Sun 20 Jan 85 12:52:15-PST.]
Jerry Hobbs at SRI-AI was in charge of it.
∂20-Jan-85 2053 JMC re: HPP visit
To: DAVIES@SUMEX-AIM.ARPA
[In reply to message sent Sun, 20 Jan 1985 20:31 PST.]
I have reserved Tuesday at 10.
∂21-Jan-85 1322 JMC HPP Visit
To: CLT, RPG, les-here, JJW
∂21-Jan-85 1255 DAVIES@SUMEX-AIM.ARPA HPP Visit
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 21 Jan 85 12:55:43 PST
Date: Mon, 21 Jan 1985 12:54 PST
Message-ID: <DAVIES.12081396752.BABYL@Sumex>
From: DAVIES@Sumex
To: JMC@SAIL
Subject: HPP Visit
cc: Davies@Sumex
It looks like we're going to have a meeting tomorrow, Tuesday, January
22 at 10 am.
The topic of discussion, of course, is multiprocessor Lisp
implementations. In particular, we'd like to find out your current
thoughts on QLambda and possible hardware. If time allows, we'll
describe some of the ideas that we've been working on over here, and
then I hope we'll have a good discussion as a prelude to closer
interaction in future.
See you tomorrow.
-- Byron
∂21-Jan-85 1327 JMC
To: SG
>Goad,Chris (Silma: 493-0145)
∂21-Jan-85 2312 JMC re: PDP6's (from SAIL's BBOARD)
To: OTHER-SU-BBOARDS@SU-AI.ARPA
jmc - The original 64K words of PDP-6 memory and even the subsequently
purchased 64K words are not connected to SAIL. I suspect they're
still at the D.C. Power Lab somewhere.
∂22-Jan-85 1154 JMC Re: no mtg next Wed
To: CLT
∂22-Jan-85 1152 SHAHN@SUMEX-AIM.ARPA Re: no mtg next Wed
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 22 Jan 85 11:52:25 PST
Date: Tue 22 Jan 85 11:50:23-PST
From: Sam Hahn <SHahn@SUMEX-AIM.ARPA>
Subject: Re: no mtg next Wed
To: NII@SUMEX-AIM.ARPA
cc: Feigenbaum@SUMEX-AIM.ARPA, Brown@SUMEX-AIM.ARPA, Delagi@SUMEX-AIM.ARPA,
RPG@SU-AI.ARPA, Aiello@SUMEX-AIM.ARPA, Saraiya@SUMEX-AIM.ARPA,
Yan@SUMEX-AIM.ARPA, Rindfleisch@SUMEX-AIM.ARPA, Davies@SUMEX-AIM.ARPA,
Schoen@SUMEX-AIM.ARPA, Vsingh@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA,
shahn@SUMEX-AIM.ARPA
In-Reply-To: Message from "Penny Nii <NII@SUMEX-AIM.ARPA>" of Thu 17 Jan 85 09:25:47-PST
In reference to comments made at this morning's meeting, I'd like to
describe how thinking in a message-passing way leads to benefits which
look exploitable (to me).
Messages necessarily are queued as asynchronous objects perform their
tasks and communicate with each other. A message queue then becomes
not only the data structure containing scheduling information for a
particular process or object, but it becomes also a data structure
with information regarding how "busy" that process or object will be.
In a pipelined system where one such busy object becomes the
bottleneck, further attempts at design-time specification of object
"size" or busyness may be misguided, so long as this one bottleneck
isn't recognized. Access by the object itself to the object's message
queue at least raises the possibility that the object detect the busy
condition, or at least a bottleneck condition. This detection could
be accompanied by a replication of itself, either through direct
cloning, or through clone-plus-(entry and exit objects), where we may
assume the entry and exit objects do not become bottlenecks, but are
simply there to redirect the messages to/from the clones.
Separate issue: What do you feel about setting up a technical
bboard-like file, say, in <xage>architecture.txt? I'll put this
message there, and see if anyone responds to it. If people use it, we
may be able to get an address for it.
-- sam
-------
∂23-Jan-85 1706 JMC re: q
To: CLT
[In reply to message rcvd 23-Jan-85 15:52-PT.]
I don't want to include the Chudnovskys at present. Maybe I will in
a subsequent draft if there are more drafts. There are several problems:
first I haven't made up my mind what role they can play. Second
including Berkeley people directly is complication enough administratively.
Third David and Gregory are almost unreachable because of their father's
cancer.
I have a thought that may partially solve the problem. Include,
$10K additional travel and consultants. I will provide a paragraph about
this that will mention their proposed role. If their role develops,
we can include them more substantially in renewal proposals. In any
case their part will be minor until there is a Qlambda and perhaps
even a Macsyma fragment.
∂24-Jan-85 0202 JMC
To: les-here
intro.pro[f84,jmc] Introduction to DARPA proposal for Qlambda on parallel processors
This is a proposal for research in implementing
an extension of Lisp for parallel processing called Qlambda.
Qlambda (Gabriel and McCarthy 1984) allows the programmer
to specify tasks that may be performed in parallel by creating
queues of tasks. The project involves acquiring a parallel
processor, developing Qlambda for it (with a subcontract), developing
a major application system for it (a variant of Macsyma), and
testing the performance of the application on substantial
symbolic computation tasks.
It is generally agreed that the main hope for large increases in
computer speed, whether for numerical work or symbolic computation as in
artificial intelligence, lies in massive parallelism. Projects are being
undertaken that will involve hundreds or even thousands of processors.
However, no-one has yet demonstrated the ability to make general purpose
use of even two processors on symbolic computation for a single problem.
Indeed even numerical computation on parallel processors has been
difficult, and there are no general purpose computation systems
that make good use of parallel processors in spite of more than
twenty years of work. Therefore, it is important to explore a variety
of approaches to getting good performance from parallel processors
on a variety of problems.
Our approach is queue-based multi-processing. It has the
following features.
1. Each processor can address the whole of memory, and
a processor may execute program anywhere in memory on data located
anywhere in memory. This makes difficulty for the hardware designer,
we are running scared on programming, so we ask the help of the
hardware people.
2. The programmer indicates when parallelism is possible
by using parallel constructions in the source language, which
is an extension of Lisp. See (Gabriel and McCarthy 1984) for
a description of this language called Qlambda.
3. When a program comes to a statement allowing
parallelism and decides (according to the computed value
of an allow-parallelism parameter in the statement) that
parallelism is to be invoked, it adds a collection of tasks
to a queue and starts on the first. When a processor completes
a task it goes to the queue for its next task. It may execute
some queue management code to decide what to do next.
4. Basing parallelism on run-time queues means that
a program isn't written or compiled for any specific number
of processors. The number available can even change during
the course of a computation. Tasks need not be of similar
length, because a processor finishing a short task merely
takes another from the queue.
5. While Qlambda is more fully described in the paper,
we mention just the statement QLET here. Its form is
(QLET allow ((x1 arg1))
.
.
.
((xn argn))
. body).
The parameter {\it allow} is evaluated first. If its value is
(), i.e. false, parallelism is not allowed and the QLET statement
behaves like an ordinary Common Lisp LET. If the value is something
else and not EAGER, then a queue of tasks is set up to evaluate
arg1 ... argn, and the processor takes a task from the queue. If
the value is EAGER, the processor sets up the queue and immediately
starts on evaluating {\it body}, suspending if it comes to a
variable whose value has not yet been computed.
The point of exhibiting QLET here is that the parameter
{\it allow} is evaluated to determine whether parallelism is allowed.
Because Lisp (and symbolic computation generally) is highly recursive,
it can generate a large number of parallel tasks. However, we need
only enough parallelism to keep our processors busy. Therefore,
the expression {\it allow} should often be false. Qlambda is designed
according to the idea that it is necessary to limit parallelism as
well as to instigate it.
We believe that it is necessary to follow through on the
development and implementation of Qlambda by trying it out on
substantial applications. These trials will most likely lead to
improvements in Qlambda and in the parallel processing hardware.
They may also determine whether it is possible to relax the requirement
that all memory be equally accessible to all processors, since
the hardware people find this expensive to implement.
For this purpose, we have chosen a Macsyma-like system
as the target application. Our reasons for choosing this rather
than an AI application are the following.
1. Macsyma and similar systems like REDUCE and SMP use
a wide variety of algorithms each with its own inner loop and
each of which presents its own problems of parallelism.
2. When a sufficient number of features have been implemented,
we can compare performance with algebraic computation systems running
on single processors.
3. The task is definite enough to be readily defined
and supervised. Some of our group are eager to undertake it.
We are also thinking about possible AI applications, e.g.
to problem solving, but are not ready to decide on one. In
addition, the parallel facility and Qlambda will be available
on the ARPAnet for others to try out.
∂24-Jan-85 0203 JMC
To: les-here
Sorry for delay. I didn't realize your message was a request.
∂24-Jan-85 0220 JMC
To: CLT
Incidentally, here is a copy of what Fateman sent.
-----------------------------------
Algebraic manipulation and parallel lisp....
We propose to examine
various areas of applications of lisp, and in particular, parallel
dialects of lisp.
Our areas of interest include algebraic manipulation programs
(typified by Macsyma) and other symbolic mathematical manipulation
which have arisen in applied mathematics and which
appear to be of interest in AI applications.
We would design, implement, analyze, and compare these results to
sequential computation.
Possibilities for use of parallel processors within algebraic
manipulation systems (taking Macsyma as a specific example).
1. Exploit obvious cases of traditional
parallel algorithms, e.g. FFT for multiplying polynomials
or try a PDE solver in some kind of semi-symbolic grid form.
(Macsyma generally does not ordinarily do either of these)
2. Use multiple processors to multiply two polynomials by
divide & conquer, or by farming out partial products. Adding them
together is tricky (and O(n↑2 log n)).
3. Examine multiple-homomorphism (mod Q) algorithms such
as GCD, ... try to do several moduli at
the same time (probably a loss since often only one modulus is needed).
A better prospect is parallel (multivariate)interpolation
and/or evaluation of a polynomial. Parallel versions of Newton
interpolation and of Horner's rule have been studied over the years.
4. Some specific modQ algorithms: e.g. Factoring over the
integers... generally several moduli ARE used. This is
not the expensive part of factoring, though. Combinatorial
matching is... can we do that?
5. Linear algebra algorithms: calculation of minors for determinants.
6. General simplification of expressions in trees: to simplify
f(a,b,c,..) one simplifies a,b,c,... and then f(a', b' , ...).
Sometimes (e.g. if f == plus), one must sort a', b' ... etc.
Use a sort-merge or similar technique. (in Macsyma, this "ordergreat"
function is quite expensive).
7. Pattern matching (e.g. for integration): Careful: many of
these patterns depend on the fact that they are tried out only
after others have failed.
8. Heuristic problem solving (NOT used in Macsyma, generally)..
and/or trees or searching in semantic networks.
9. Storage allocation: user-controlled reference counts maintained
at the same time, parallel GC of Large Objects. Maintenance of data
base of some sort (this may be harder in parallel because of simultaneous
updating problems). None of this is done in Macsyma now.
10. Parallel GC of cons cells using some well-known algorithms
(Since Macsyma on VAX or Sun spends only 30% of time in GC, using
a parallel version could not improve performance by more than 30%.)
11. Frame-based objects with multiple representations: compute
simultaneously with different forms (e.g.
polynomials:[expanded, recursive, factored],
curves:[parametric, point-set, constraints],
matrices:[dense, sparse, factored])
Resources needed:
We assume there will be an implementation effort at Stanford which
will produce a Q-lambda simulation and an actual Q-lambda implementation
on a parallel architecture machine.
The simulation would be available for use on hardware already in place
at UCB (including VAX, SUN, Symbolics, or Xerox), but that the actual
parallel processor would be at Stanford. Substantial computing would
be required at UCB for program preparation, testing, communication,
etc.
3 Research Assistants (Carolyn Smith, Scott Morrison, P. Mcgeer) would
work on this project; a part-time programmer would be hired, and some
clerical assistance for project administrative tasks etc.
1 Month of summer support for Fateman.
Other support for PI:
Fateman has a contract with the Army Research Office for a project
in algebraic manipulation, ($63k/year); Fateman is one of 6
co-investigators
on the SPUR project at UCB ($4.4 million over 4 years); Fateman and
Despain are co-principle investigators on an NSF contract ($25k)
for running a conference on high speed symbolic computation to be
held in February, 1985.
∂24-Jan-85 0226 JMC Fateman material
To: les-here@SU-AI.ARPA
CC: CLT@SU-AI.ARPA, fateman@UCB-VAX.ARPA
Clearly it's not in a form directly usable in a proposal. However, it is
sufficient for us to mull over and think about how it might best be put. I'll
do something tomorrow and get back to you - probably with an outline of
how we might ask Fateman to rewrite. Of course, you can ask him for
budget information now. I suggest you ask him to put the budget information
just as though it were for a UCB proposal, since that will undoubtedly
be easiest for him. We'll submit it informally that way with a note to
DARPA that the optimal contractual arrangement will have to be determined
later.
∂24-Jan-85 0346 JMC
To: wiederhold@SUMEX-AIM.ARPA
Inviting Wirth and Halpern to what?
∂24-Jan-85 1516 JMC Info on CSLI summer school
To: ingrid@SU-CSLI.ARPA
∂24-Jan-85 1345 cha@mitre-bedford Info on CSLI summer school
Received: from MITRE-BEDFORD.ARPA by SU-AI.ARPA with TCP; 24 Jan 85 13:44:30 PST
Date: Thursday, 24 Jan 1985 16:38-EST
From: cha@Mitre-Bedford
To: jmc@su-ai
Cc: cha@Mitre-Bedford
Subject: Info on CSLI summer school
Dear John,
I understand that the CSLI are planning a cummer school and meeting at
Stanford on July8-20, 1985. According to the flier I have, I can get more
info and registration forms from Ingrid Deiwiks, CSLI, Ventura Hall.
Since yours is the only arpa address I have handy, I wonder if you could relay
my request to Ingrid or the appropriate parties.
The info and registration forms can be sent to me at:
Charles Applebaum
Department of Mathematics and Statistics
Bowling Green State University
Bowling Green, Ohio 43403
By the way, thank you for sending the papers.
Sincerely,
Charles Applebaum
∂24-Jan-85 1518 JMC re: Info on CSLI summer school
To: cha@MITRE-BEDFORD.ARPA
[In reply to message sent Thursday, 24 Jan 1985 16:38-EST.]
I have forwarded your message to INGRID@CSLI, but I'm not sure whether
you could reach CSLI directly on the ARPAnet or if you have to
use an intermediate address.
∂24-Jan-85 1522 JMC
To: nilsson@SU-SCORE.ARPA
Name of Organization Number of Days
Winter '84 Spring '84 Summer '84 Autumn '84
Information International 2 2 1 1
Inference Corp. 2 2 2 3
MAD computer 0 1 0 1
IBM 0 0 5 0
MCC 0 0 0 1
Name________________
Signed______________
Date________________
∂24-Jan-85 1523 JMC Bob Kahn is here
To: RPG@SU-AI.ARPA, CLT@SU-AI.ARPA, les-here@SU-AI.ARPA,
fateman@UCB-VAX.ARPA
He dropped by and left a note. Seeing him may save a trip to Washington
or make such a trip more productive. Therefore, I would like to catch
him tonight or tomorrow with whoever else can make it. When I reach
him I'll send another message with a time.
∂24-Jan-85 1703 JMC
To: CLT@SU-AI.ARPA, RPG@SU-AI.ARPA, les-here@SU-AI.ARPA,
Fateman@UCB-VAX.ARPA
CC: RA@SU-AI.ARPA
∂24-Jan-85 1626 RA Bob Kahn
Bob just called to tell you that things did not work for tonight. He would
like to come and see you tomorrow at 2:30. He has time until 5:30. If you
cannot make it at 2:30 and would like him to come by later, please let me know
because he is going to be on campus earlier and will check with me whether
2:30 date is ok.
To CLT, RPG, LES, Fateman
Those who can should make it, because it may save us a trip to Washington
or make one more fruitful. I think it is worthwhile for him to meet
as many of the principal people as possible, and we'll be more responsive
to his concerns if we all know them. I'm sorry there didn't turn out to
be any flexibility in time. - John
∂24-Jan-85 1728 JMC microadjustment
To: kahn@USC-ISI.ARPA, CLT@SU-AI.ARPA, RPG@SU-AI.ARPA,
les-here@SU-AI.ARPA, fateman@UCB-VAX.ARPA
Make that 3:15 if possible.
∂25-Jan-85 0131 JMC
To: RA
Ask about both going through Paris and more direct routes.
∂25-Jan-85 1323 JMC re: fantasy in HCN
To: CS.RICH@UTEXAS-20.ARPA
[In reply to message sent Fri 25 Jan 85 10:05:34-CST.]
Elaine,
Yes, I got the material, but I have been hung up by work and
two questions. First, what is the correct spelling of Kool-aid. I
keep forgetting to find out when I go to the store. Is that it or
is it Kool Aid or Kool-ade, etc? Second, thoughts of elaboration occur
to me, e.g.
"Such a spirit of compromise will avoid turning this issue into
a continuing problem. The students may be persuaded to drop their plan
of having a drink-in with Kool-aid at the Health Service every August 6."
I can't decide whether this would be overdoing it.
Are there any modifications or improvements you would like to make.
I suppose plan zero is to fire off the original version with both
signatures.
Regards,
John
∂25-Jan-85 1328 JMC reply to message
To: TW
[In reply to message rcvd 25-Jan-85 09:32-PT.]
I have some hesitations about the quality of my lectures. If this were
to be a regular event, some effort would be worthwhile to get a really
good set of lectures. I have no objection to trying it with the present
lectures. There were three lectures given while I was away by Joe
Weening which some of the students found too compressed. Also some
of the lectures given while I had a bad cold probably are even worse
than the rest.
∂26-Jan-85 1157 JMC presidency
To: fikes@USC-ECL.ARPA, aaai-office@SUMEX-AIM.ARPA
Raj Reddy has agreed to be nominated to follow Pat Winston provided
Winston serves a two year term. I still suppose we need to go to
the membership to change the term.
∂26-Jan-85 1157 JMC presidency
To: fikes@USC-ECL.ARPA, aaai-office@SUMEX-AIM.ARPA,
bledsoe@UTEXAS-20.ARPA
Raj Reddy has agreed to be nominated to follow Pat Winston provided
Winston serves a two year term. I still suppose we need to go to
the membership to change the term.
∂26-Jan-85 1306 JMC bees
To: Sy.SLogin%CU20B@COLUMBIA.ARPA
jmc - Yes, NASA has sent up bees. I have a videocassette distributed
by the L-5 Society gluing together the "home movies" taken by the
astronauts on several Shuttle flights. There is about a 10 second
sequence showing the astronauts handling a beehive with bees buzzing
around in it. The commentary merely said that the astronauts wanted
to be assured that the bees couldn't get out. Surely writing to
or phoning the Johnson Space Flight Center would get the name of
the Principal Investigator of the experiment.
∂26-Jan-85 1307 JMC re: A random question (from SAIL's BBOARD)
To: OTHER-SU-BBOARDS@SU-AI.ARPA
jmc - Yes, NASA has sent up bees. I have a videocassette distributed
by the L-5 Society gluing together the "home movies" taken by the
astronauts on several Shuttle flights. There is about a 10 second
sequence showing the astronauts handling a beehive with bees buzzing
around in it. The commentary merely said that the astronauts wanted
to be assured that the bees couldn't get out. Surely writing to
or phoning the Johnson Space Flight Center would get the name of
the Principal Investigator of the experiment.
∂26-Jan-85 1741 JMC more bees
To: Sy.SLogin%CU20B@COLUMBIA.ARPA
jmc - "The 3,500 bees launched on the shuttle as part of an experiment
conceived by Dan Poskevich (now a student at Tennessee Tech) laid down
30 square inches of what appears to be mostly normal comb during the
mission. The bees walked, floated, linked themselves into a 10-inch
long chain, and even flew. They far outperformed a matched comparison
group on the ground; for some reason, the earthbound controls had barely
started their honeycomb by the time the space bees returned.
(July/Aug Science 84)". This item was copied from Nov./Dec. 1984
L-5 News.
∂26-Jan-85 2138 JMC re: presidency
To: ATP.Bledsoe@UTEXAS-20.ARPA, fikes@USC-ECL.ARPA,
aaai-office@SUMEX-AIM.ARPA, bledsoe@UTEXAS-20.ARPA
[In reply to message from ATP.Bledsoe@UTEXAS-20.ARPA sent Sat 26 Jan 85 23:22:20-CST.]
The proposition put to the membership needs to say when the
president-elect is chosen. I would favor the election just
before the new president takes office, i.e. the president-elect
would be chosen two years in advance. However, one year in
advance is certainly viable. This would mean nominating Raj
this Spring. His willingness to be nominated depended on the prospect
of not taking office till Summer 1987, however. I would suggest that
we risk the embarassment of having the membership elect him and reject
the two year term. Since the vote in the Executive Council for changing
the term was unanimous, it is unlikely that the membership will reject
it.
∂26-Jan-85 2149 JMC
To: RA
I have decided not to go via Paris. The other is ok.
∂27-Jan-85 1527 JMC
To: reges@SU-SCORE.ARPA
Who maintains the list FACULTY@SCORE?
∂28-Jan-85 0000 JMC re: gwai-invited talk
To: HST
[In reply to message rcvd 27-Jan-85 23:20-PT.]
Business class would be good, and I don't need an honorarium.
Please make a suggestion as to how long I should stay at meeting,
taking into account that I don't know German. Then please suggest
specific days. I will stay longer in Europe, of course, and would
visit AI places in Germany after conference. Actually you might
not get stuck for full travel expense, because I have another
reason to be in Europe.
∂28-Jan-85 1059 JMC re: CS226
To: RESTIVO@SU-SCORE.ARPA
[In reply to message sent Mon 28 Jan 85 09:02:05-PST.]
Yes.
∂28-Jan-85 1127 JMC
To: RA
Business to first.
∂28-Jan-85 1136 JMC
To: RA
postpone meeting
∂28-Jan-85 1137 JMC postpone meeting
To: RA
I'm expecting a Jack Harper at 2pm, but I won't be done with my
meeting in Ventura till 3:15. Try to call his Denver number, in CAL,
and find a local number to postpone meeting. Otherwise, when he comes
ask Joe or Carolyn to find out about his parallel Lisp.
I'll be back at 3:15.
∂28-Jan-85 1601 JMC reply to message
To: RA
[In reply to message rcvd 28-Jan-85 13:23-PT.]
It seems to me the Department should pay for it in connection with his
being an Industrial Lecturer, say for a year, and then we'll see.
∂29-Jan-85 1525 Mailer failed mail returned
To: JMC@SU-AI.ARPA
In processing the following command:
MAIL
The following message was unsent because of a command error:
------- Begin undelivered message: -------
∂29-Jan-85 1525 JMC !aster!pratt@Berkeley
To: SUN@SU-AI.ARPA
re: parking
[In reply to message sent Tue, 29 Jan 85 11:49:54 pst.]
------- End undelivered message -------
∂29-Jan-85 1528 JMC parking
To: JJW
The reply macro failed on this. Can something be done?
∂29-Jan-85 1226 sun!aster!pratt@Berkeley parking
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 29 Jan 85 12:25:57 PST
Received: by UCB-VAX.ARPA (4.24/4.41)
id AA02377; Tue, 29 Jan 85 12:27:23 pst
Received: from aster.sun.uucp by sun.uucp (1.2/SMI-1.2)
id AA12181; Tue, 29 Jan 85 11:41:29 pst
Received: by aster.sun.uucp (4.24/3.14)
id AA09541; Tue, 29 Jan 85 11:49:54 pst
Date: Tue, 29 Jan 85 11:49:54 pst
From: sun!aster!pratt@Berkeley (Vaughan Pratt)
Return-Path: <pratt@aster>
Message-Id: <8501291949.AA09541@aster.sun.uucp>
To: jmc@su-ai.ARPA
Subject: parking
Cc: aster!pratt@Berkeley
∂29-Jan-85 1533 JMC re: parking
To: sun!aster!pratt@UCB-VAX.ARPA
[In reply to message sent Tue, 29 Jan 85 11:49:54 pst.]
There has been no discussion of parking while I have been in the Senate.
My impression is that the actual parking wallahs, who are not policemen,
are given no discretion. Lester Earnest, before he left, once got
a ticket squashed by complaining to Marvin Herrington, the Stanford
"police chief". The ticket, given by a policeman at 1:30 am, was
for parking in a handicapped zone, which cost $25 at that time. Les
argued that if the policemen had nothing better to do at 1:30am
than give tickets for something that couldn't have inconvenienced
the handicapped at that hour, then Stanford could get by with fewer
policemen. In any case, I think Herrington is the person to talk to.
There is also a faculty parking committee, but I suggest that if you
contact them, you should not behave rationally; if you sound like
a reasonable person with an interest in parking, you may find yourself
on the committee.
∂29-Jan-85 1537 JMC re: job and paper
To: KUO
[In reply to message rcvd 29-Jan-85 12:36-PT.]
1. You may certainly give my name as a reference.
2. As to authors of your paper I have no opinion except that it should
not include me. My contribution to the subject is sufficiently covered
in the report of which I was a co-author with Sato, et al.
∂29-Jan-85 1858 JMC
To: JMC
10am Brown letter
∂30-Jan-85 0101 JMC re: TEX for PDP 11-70 (from SAIL's BBOARD)
To: OTHER-SU-BBOARDS@SU-AI.ARPA
jmc - Next time he has this precise question he will do so. However,
when he has some other question he will probably address it to BBOARD.
If some public spirited students would create an address
QUERY@SCORE, they could spare the rest of us most of the questions
that have appeared. If they got really desperate, the maintainers
of QUERY could address the BBOARD.
∂30-Jan-85 0138 JMC
To: llw@S1-A.ARPA
fight[w85,jmc] Picking a fight with western Europe
For the U.S.A. to pick a fight with Western Europe
might have considerable advantages for both.
1. For the last 40 years we have kept 300,000 troops in
Western Europe to deter the Soviet Union from attacking them,
even though Western Europe has a larger population and industrial
population than the Soviet Union or the United States.
In spite of this, it is said that if the Russians launched a
conventional attack and we didn't reply with nuclear weapons,
they would be at the English channel in a week.
2. As many here and in Europe point out, this policy
of possible first use of nuclear weapons is dangerous for us,
for Europe and the world. We have chosen to accept this danger
for lack of a better alternative.
3. Western Europe has more than twice the population of
the Soviet Union and more than twice the industry. In the past
Western Europe never considered itself weak compared to Russia.
Indeed Germany was willing to take on by itself an alliance of
which Russia was only one component and not the most important.
4. The reason Western Europe doesn't match the Soviet
Union militarily is that each of its politicians and political
parties finds that electoral success depends on saving money on
defense. Since the U.S. is defending them, is inclined to be
bossy from time to time, the presence of the soldier causes
strain, Soviet propaganda against U.S. presence has its successes
from time to time, there is unlikely to be much change as long
as the present relationship continues.
5. The situation might be better if we weren't friends
with them. If the relationship became hostile enough so that
they felt obliged to defend themselves against us, then they
would really rearm, and backward Russia would be regarded as
it used to be.
6. Here are some possible ways of picking a quarrel.
We could declare that Yugoslavia is outside our defense
perimeter. Unfortunately, I fear this wouldn't make the
Europeans mad enough.
7. One way that might work is to propose a deal with
the Russians at their expense. One such deal is that the U.S.
could propose to withdraw completely from West Berlin in exchange
for a Soviet agreement to abandon all relations with Nicaragua,
diplomatic, military and commercial. The Russians wouldn't have
to agree to make the Europeans, and especially the Germans,
quite mad at us. We could also unilaterally withdraw from
West Berlin.
8. It might be especially important to get the British
mad at us. Tip O'Neill and Teddy Kennedy could introduce bills
to support the IRA goal of taking over Northern Ireland.
9. We could escalate a trade war. A big trade
deal with the Japan at European expense might do it.
10. We could prevent the prosecution of soldiers guilty
of robberies and rapes in Germany.
11. The simple act of declaring a date for withdrawal
of our troops from Western Europe might suffice, but it should
be done more in anger than in sorrow to have the best effect.
12. Probably it would be better to be kicked out than
to withdraw voluntarily.
13. Some of the desired effects in arousing Western European
worries and hostility might be achieved merely by a significant
group of politicians pushing a hostile policy. For example, a
Congressional bill to withdraw unilaterally from West Berlin
would have considerable effect if it came even close to passing
or if it passed and was vetoed.
14. Proposals of the above nature might lead to negotiations
with the Europeans and also to negotiations with the Soviets.
In our negotiations with the Europeans, we should demand that they
support freedom elsewhere if they want our support in Europe. The
biggest example was Vietnam. One of the many ways we could have
avoided losing in Vietnam was with European troop support. More
recently a policy of kicking the Syrians out of Lebanon would
have been feasible with European support.
As for the Russians, perhaps they would concede something
to avoid the prospect of German nuclear weapons.
There are some objections.
1. In so far as our policy was directed at the goal of
making the Europeans stronger, they would see through it, and
there might not be much effect. It would be better if the
hostility were genuine.
2. It is thought that Europe might be Finlandized. People
are vague about what that means, so it seems like something
the Europeans might accept, but consider two aspects of the
Finlandization of Finland. First when someone escapes from
Russia across the Finnish border, the Finns send him back
if they catch him. Finnish farmers, however, often conceal
escapees and help them get on to Sweden where they are safe.
Imagine the reaction in West Germany to a proposed policy of
giving back escapees across the Wall. Second the press in
Finland is prevented from criticizing the Russians to the
extent that international events embarassing to the Russians
are often not reported at all.
All this generates hostility to the Russians among
Finns. Finland is too small a country for this hostility
to have much outlet. If Western Europe were Finlandized,
the resulting hostility to the Russians could generate
rearmament.
Still Finlandization followed by a Soviet takeover,
say at the start of a reversal of Finlandization, is a
possibility.
3. Uninhibited Western European rearmament would naturally involve
West German nuclear weapons. The ever-diminishing part of the population
that remembers World War II finds this a considerable disadvantage. It
might just have to be accepted on the grounds that the present situation
is even more dangerous. The installation of the Pershings gives us the
option of offering to sell them to the Germans when we withdraw our
troops. While discussing with one German their negative attitude
towards the Pershings, it suddenly occurred to me to ask, what if
they were German missiles. He said that in that case the attitude
of many Germans would be quite different.
4. In my view the strongest objection to any variant of these
proposals is simple conservatism. Unprecedented actions on our part
might generate unexpected actions on the part of others, e.g. the
Russians. Maybe the present situation isn't
so bad. Perhaps this objection is sufficient to justify delaying
action in the direction of picking a quarrel with Western Europe
until the defense situation gets much worse. Maybe it never will.
∂30-Jan-85 0143 JMC
To: CLT
Please pay Zella Thursday. She gets $75 now.
∂30-Jan-85 1213 JMC re: parking
To: sun!aster!pratt@UCB-VAX.ARPA
[In reply to message sent Wed, 30 Jan 85 11:41:29 pst.]
Perhaps I overdid it. Just don't be entirely rational.
∂30-Jan-85 1215 JMC give them an inch ...
To: BH
Now do I still need the quotes in this one?
"blasgen.yktvmt.ibm"@csnet-relay
∂30-Jan-85 1219 JMC re: Space Needs Review
To: GOLUB@SU-SCORE.ARPA, FFL@SU-AI.ARPA, faculty@SU-SCORE.ARPA
[In reply to message from GOLUB@SU-SCORE.ARPA sent Wed 30 Jan 85 12:11:45-PST.]
"sitting in our office ..." suggests a tactic. We should sit five
faculty to an office, moving people from offices that have already been
visited to offices yet to be visited.
∂30-Jan-85 1300 JMC Tuesday lunches
To: halpern.ibm-sj@CSNET-RELAY.ARPA
I kept forgetting to tell you that you are welcome to come to the
faculty Tuesday lunches. They begin about 12:15, feature free
sandwiches, discuss various topics and are held in the first
floor conference room, 140 perhaps.
∂30-Jan-85 1302 JMC
To: BH
I tried one of my addresses with dots and it seems to work now.
∂30-Jan-85 1316 JMC credit
To: ostrom@SU-CSLI.ARPA
I met Stuart Reges in the hall, and he will call you about making some
reasonable arrangement for students getting academic credit for courses.
∂30-Jan-85 1348 JMC
To: RA
martin.1
∂30-Jan-85 1455 JMC reply to message
To: REGES@SU-SCORE.ARPA
[In reply to message sent Wed 30 Jan 85 14:20:17-PST.]
On that list I would like to be JMC-LISTS@SAIL.
∂30-Jan-85 1517 JMC (→17030 3-Feb-85)
To: "#___JMC.PLN[2,2]"
I can be reached at the Hotel Merkur in Vienna Austria until
1985 February 3 Saturday.
∂03-Feb-85 0000 JMC Expired plan
To: JMC
Your plan has just expired. You might want to make a new one.
Here is the text of the old plan:
I can be reached at the Hotel Merkur in Vienna Austria until
1985 February 3 Saturday.
∂03-Feb-85 1520 JMC logic and ai
To: barwise@SU-CSLI.ARPA
I read your notes of the discussion, and I also have some notes, made
during my trip and which I will have read into the computer and will
distribute. I don't believe the net problem is NP-complete, because
I think I have a polynomial algorithm for it, but this is a side issue.
I would like to resume a discussion of the question of whether logic
is appropriate for a robot to represent what it knows about the world
and the laws giving the consequences of its actions. The point for me
isn't the somewhat forlorn hope than one of us will persuade the other
to change his area of research. Rather I think that those whose
opinion is that logic is unsuitable have some intuitions about difficulties,
and some of these intuitions may be sharpenable into problems which
the advocates of logic can try to solve. The dogs-and-trash-cans problem
is a simple one on which opinions may differ.
Are you interested in resuming the discussion, perhaps more sharply
focussed? If so, why don't you suggest a convenient time?
∂03-Feb-85 1832 JMC
To: RA
See allen.rv1 for text for Allen proposal review; the form is in OUT box.
∂03-Feb-85 1922 JMC
To: SMC
elepha[s80,jmc]
∂03-Feb-85 2239 JMC re: CS224
To: NILSSON@SU-SCORE.ARPA
[In reply to message sent Sun 3 Feb 85 15:38:56-PST.]
title: Common sense knowledge and reasoning in logic.
The lecture would emphasize axiomatizations using circumscription.
The only Thursday presently excluded is May 30.
∂04-Feb-85 0112 JMC fantasy finally
To: hi.rich@MCC.ARPA
I've been on a trip to Europe. It is Kool-Aid. If you MAIL me a home
address, a work phone number (for them to use in verifying if they
do that) and the year of your class, I'll prepare a draft and USmail
it to you.
∂04-Feb-85 1340 JMC
To: FY
Thanks, I had.
∂04-Feb-85 1555 JMC Broad article
To: llw@S1-A.ARPA, rah@S1-A.ARPA
There's a new one. Filling him up with lots of free cokes when he visited
last year seems to have proved an excellent investment.
∂05-Feb-85 1153 JMC
To: VAL
memo.pub[let,jmc]
∂05-Feb-85 1506 JMC re: biblio clean version
To: perlis@TOVE.ARPA
[In reply to message sent Tue, 5 Feb 85 17:54:47 est.]
Many thanks for the bibliography. I didn't suppose it would be so
much trouble as we keep items like that on-line. What's TOVE? Is
it slithy?
∂05-Feb-85 1517 JMC re: Chomsky book
To: Sells@SU-CSLI.ARPA
[In reply to message sent Tue 5 Feb 85 08:46:49-PST.]
I wwuld like a copy of the chomsky book.
∂06-Feb-85 0009 JMC re: My father-in-law / Japan
To: SG
[In reply to message rcvd 05-Feb-85 23:23-PT.]
I would be very glad to accept your father-in-law's invitation.
At present I have planned to be in Japan from June 18 to June 21 and
some additional time. When my plans are more precise I will let you
know.
∂06-Feb-85 0016 JMC Smart Smart
To: rosensch@SUMEX-AIM.ARPA
Thanks for the Smart chapter. I agree with almost all his conclusions,
although some of his arguments, particularly his refutation of the
argument based on Godel's theorem, aren't correct. It seems to me that
if philosophers want to do better, they must think much more concretely
about artificial intelligence. Smart is too vague.
If there are some specific points you want to discuss, I'd be glad to
do so.
∂06-Feb-85 0804 JMC re: slithy things
To: perlis@TOVE.ARPA
[In reply to message sent Wed, 6 Feb 85 11:04:58 est.]
Thanks for the explanation and the paper.
∂06-Feb-85 2233 JMC
To: restivo@SU-SCORE.ARPA
If Zohar Manna hasn't yet reached you, call him.
∂07-Feb-85 1811 JMC re: Interview Appointment
To: LLW@S1-A.ARPA
[In reply to message sent 07 Feb 85 1759 PST.]
I was in meetings this afternoon and only returned after 5. There is
a message to phone someone in the Lab's Security Department, and I'll
do it tomorrow morning. On Tuesday's I teach, but I assume that another
time will be arrangable with them. Thanks for your efforts.
∂07-Feb-85 1906 JMC re: Russell Baker on Word Processing (from SAIL's BBOARD)
To: OTHER-SU-BBOARDS@SU-AI.ARPA
jmc - The point of the Russell Baker piece, as anyone with any degree
of literary experience would know, almost certainly was, as I interpret
it to be, that word processors encourage, in some way that typewriters,
according to his prejudices or perhaps his experience, don't, running on
and on and producing not merely paragraphs, but actual sentences of excessive
and difficult to understand length, at least for people, of whom Steve
Tepper and perhaps even Arthur Keller may belong to the group of which,
but for some of us whose mental processes run in different, though
not necessarily superior, ways, such sentences are sometimes even
enjoyable, because, while they do not necessarily convey any single
precise idea that might be expressed conventiently in predicate
calculus or other logical formalism, they produce certain feeling
of which Lawrence Sterne, in that great work Tristram Shandy, and
James Joyce in several books, but above all in Finnegans Wake, made
popular, and which some of us have learned to sometimes, when we aren't
looking for actual information, enjoy, admittedly only when we are
in a mood not hung up by a passion for precision or haste to get
what point if any the author may be trying to make. I think Russell
Baker could have produced just as long sentences with a typewriter or
even a quill.
∂07-Feb-85 2104 JMC NSF travel grant to Japan
To: feferman@SU-CSLI.ARPA
CC: CLT@SU-AI.ARPA
They granted it. Carolyn will get in touch with everybody about
making arrangements with Sato and scheduling trips.
∂08-Feb-85 0018 JMC Russian jacket
To: RA
It seems that I put on one of the Russians' jacket by mistake that I
suppose had been left in my office when I went off to the Academic
Senate. At the end of the meeting after wandering around, I noticed
that the jacket hanging on the chair wasn't mine and supposed that
someone else at the meeting had taken my jacket instead of his own.
Clara Bush, the Academic Secretary, should have it or know where it
is. Please locate it and arrange for its retrieval. The Russians
will be back at 11. One of them left his notebook by mistake. It's
on my refrigerator.
∂08-Feb-85 0046 JMC visitors
To: nilsson@SU-SCORE.ARPA
It occurs to me that we might consider asking for a regular visiting
professorship. We could use it to invite potential senior faculty
for mutual inspection.
∂08-Feb-85 1142 JMC project
To: laube@SU-SCORE.ARPA, CLT@SU-AI.ARPA
Carolyn Talcott, room 362, 7-3334,CLT@SAIL has a project you
might be interested in.
∂08-Feb-85 1508 JMC reply to message
To: RA
[In reply to message rcvd 08-Feb-85 15:03-PT.]
Tell him LISP by Winston and Horn published by Addison-Wesley.
∂08-Feb-85 1841 JMC re: Earthquake Awareness Week In California (info) (from SAIL's BBOARD)
To: OTHER-SU-BBOARDS@SU-AI.ARPA
jmc - Who can be so lacking in prudence and public spirit as to quarrel
with earthquake preparedness? I can - though briefly. There is a negative
correlation between personal income and death rate taken by states. Few
would be surprised by the statistic that in more prosperous states
people tend to live longer. The co-efficient, as computed from the
1980 Statistical Abstract of the United States, is $2.5 million per life.
The conclusion, forgoing the intermediate steps of the argument, is that
an otherwise useless expenditure of $2.5 million costs a life. A recent
paper by a Stanford author whose name I forget computes that current
earthquake preparedness measures are costing $5 million to $6 million
per expected life saved, i.e. are costing lives. It is here not a
case of comparing lives with other values, which often is appropriate.
Excessively expensive safety measures simply cost lives. I don't know
about Earthquake Preparedness Week itself or the measures recommended,
but I see no indication that cost-effectiveness has been considered.
My guess is that the BBOARD commenters so far are correct in considering
that Earthquake Preparedness Week has primarily entertainment value.
∂08-Feb-85 2222 JMC qlamb.tex[pap,rpg]
To: RPG
CC: CLT
In general it looks good. However, I had always imagined a more
depth first attitude toward queues. Under these circumstances
it doesn't matter if the queues get long, and there is no
commitment that each task on the queue make progress.
∂09-Feb-85 1709 JMC
To: CLT
02-22 Fri, Nilsson dinner
03-16 dinner with Hurds, Quintus, 6pm
∂09-Feb-85 1750 JMC earthquake
To: treitel@SUMEX-AIM.ARPA
No doubt some measures are warranted such as building codes forbidding
unreinforced adobe buildings. The point is to get a realistic view
of what costs are warranted for what degree of protection.
∂09-Feb-85 1754 JMC industrial lectureship
To: pereira@SRI-AI.ARPA
Are you interested in being one next year? Do you need more info
about it or do you know enough from Bob Moore and Richard Waldinger?
∂10-Feb-85 0453 JMC
To: llw@S1-A.ARPA
Interview scheduled Tuesday morning.
∂10-Feb-85 1156 JMC re: Earthquake Awareness Week In California (info) (from SAIL's BBOARD)
To: Tyson@SRI-AI.ARPA
[In reply to message sent Sun 10 Feb 85 11:40:28-PST.]
You apparently misunderstood. Lives can be saved much more cheaply than
$2.5 million apiece. Some years ago the figure was $100,000 apiece
for lives saved by installing better traffic signals and $30,000
apiece by better paramedic services. If you are willing to spend
your money on public health measures in underdeveloped countries,
you can do much better than that. The $2.5 million figure says is
based on increasing personal income randomly by $2.5 million, letting
people spend it as they will. Some will be spent on sky diving which
costs lives, some will be spent on movies,
some will be spent on car seats and some will be spent on
safety via taxes. Conversely, taking $2.5 million out of personal
income, whether it is spent on defense, art, or safety costs a life.
How to evaluate defense or art vs. lives isn't obvious, but suppose
the money is to be spent on safety measures, i.e. to save lives.
Then if each $2.5 million doesn't save a life, there is a net loss
over doing nothing. While much expenditure on saving lives, as
mentioned above, meets this criterion by a very large margin, certain
expenditures don't. Prominent in the latter category are expenditures
imposed by government on organizations perceived by influential
segments of the public as ``bad guys'', e.g. public utilities.
The money spent on safety measures at Diablo Canyon would save more
lives if simply used to reduce utility rates.
∂10-Feb-85 1223 JMC president-elect
To: bledsoe@MCC.ARPA, aaai-office@SUMEX-AIM.ARPA
Don't forget to include a proposal about when the president-elect
is chosen. Should it be a year in advance of taking office or
two years? Two years seems simpler to me.
∂10-Feb-85 1647 JMC re: cs224
To: NILSSON@SU-SCORE.ARPA
[In reply to message sent Sun 10 Feb 85 16:01:22-PST.]
ok
∂10-Feb-85 1839 JMC you don't seem to understand
To: SMC
I see that some of my files refer to tex macro files in your area.
Please put the macro file in let,jmc and change all the references.
What if you go away and your files get deleted?
∂10-Feb-85 2354 JMC
To: HST
I'm not sure yet; I'll let you know later.
∂11-Feb-85 0443 JMC
To: nilsson@SU-SCORE.ARPA
Perhaps Goguen is a possibility.
∂11-Feb-85 1744 JMC re: industrial lectureship
To: PEREIRA@SRI-AI.ARPA
[In reply to message sent Mon 11 Feb 85 17:32:34-PST.]
I need a course description suitable for inclusion as is in the Stanford
catalog. The deadline for the Department to submit the material is
the 28th. I'd like it by next Monday if feasible.
∂11-Feb-85 1749 JMC industry lectureship
To: bobrow.pa@XEROX.ARPA
Would you or one of your colleagues be interested in giving
a course next year? There is pay though not much. The courses
are listed in the catalog, so I'd need a catalog statement well
before the deadline for the Department to submit catalog copy
which is the 28th. Any topic relevant to programming languages
or AI would be fine. This year the lecturers were Skip Ellis
from Xerox, Joe Halpern from IBM and Richard Waldinger from SRI.
I think the pay this year is $3K or 1/16 of annual salary, whichever is
less.
∂11-Feb-85 2001 JMC more trouble
To: SMC
The TEX files won't TEX now that you have moved them, because
they refer to JMCMAC.TEX without a directory. They need to
refer to JMCMAC.TEX[LET,JMC] and that file must be move there.
This kind of tedious business is important to get right, but
take comfort in the fact that time you spend getting it right
is being paid for.
∂11-Feb-85 2125 JMC
To: GLB
Please reprint and distribute First order theories of propositions and individual concepts.
∂11-Feb-85 2129 JMC re: FORUM activities
To: RA
[In reply to message rcvd 11-Feb-85 10:28-PT.]
I plan to attend the buffet, Wednesday lunch and the banquet.
∂11-Feb-85 2133 JMC re: Your Visit
To: AI.Woody@MCC.ARPA
[In reply to message sent Thu 7 Feb 85 11:38:29-CST.]
I will mail a draft of the monadic to you tomorrow morning. I would
like reservations at the same hotel as before for Thursday, Friday
and Saturday. Carolyn and I are indeed coming separately.
∂11-Feb-85 2219 JMC Federal express to W. W. Bledsoe at MCC
To: RA
a copy of my paper "A normal form for monadic formulas". If
there is one on your terminal when you get in send that. Otherwise,
dover the file monadi.dvi[w85,jmc].
∂12-Feb-85 0016 JMC
To: les-here
Doesn't look like I'll get to the proposal till tomorrow night.
∂12-Feb-85 0447 JMC
To: RA
Please mark the paper "draft" before you send it.
∂12-Feb-85 0455 JMC (on TTY20) finger
To: BUG-finger
finger@stanford gets stuck on LaBrea. It neither gives an
answer nor times out.
∂12-Feb-85 1303 JMC result already known
To: woody@MCC.ARPA
CC: VAL@SU-AI.ARPA
Vladimir Lifschitz tells me that my normal form was included in Behmann's
1922 paper and is included in Church's book as an exercise. I haven't
checked it yet, but he has always been right about such things.
Nevertheless, I am still confident that many logic problems
arising in AI belong to classes of formulas decidable for similar
reasons. The point is to find them.
∂12-Feb-85 1516 JMC Journal of Automated Reasoning
To: library@SU-SCORE.ARPA
published by D. Reidel is a must.
∂12-Feb-85 1519 JMC re: Chess and EKL
To: RESTIVO@SU-SCORE.ARPA
[In reply to message sent Tue 12 Feb 85 15:17:09-PST.]
Sure. Come and see me. Did you talk with Manna?
∂12-Feb-85 1524 JMC re: seminar on circumscription
To: VAL
[In reply to message rcvd 12-Feb-85 15:06-PT.]
title for first talk: Unsolved problems with circumscription
I don't know for sure who's interested beyond you, me and
Ben Grosof. However, I suggest you make up a notice, both
paper and electronic and ask the Department to post it.
Besides Stanford, it should go to SRI, IBM, Xerox, HP, Fairchild
AI. At Stanford the philosophy and math depts. should be
included.
∂12-Feb-85 1756 JMC re: burge
To: CLT
[In reply to message rcvd 12-Feb-85 17:43-PT.]
I looked but couldn't find Burge.
∂13-Feb-85 0044 JMC fantasy in HCN
To: rich@MCC.ARPA
I suppose you got the letter by now and have sent it on if it's ok.
I'll be at MCC Friday and Saturday and will be at the Brookhollow again
Thursday night, arriving Austin Thursday night and leaving Sunday noon.
Hope to see you.
∂13-Feb-85 0104 JMC In defense of dinosaurs, i.e. time-sharing
To: su-bboards@SU-AI.ARPA, csdfacilities@SU-PESCADERO.ARPA
Computing facilities:
1. Compared to 10 years ago, CSD has adequate facilities in some
absolute sense. Anyone wanting to prepare a report, a file or
even a book can do it at a rate limited by himself rather than
by computing facilities. Anyone wanting to run a Fortraan, Pascal
or Lisp program can do so provided his requirements for memory
and crunching are moderate. Only a few CSD people are limited
in their accomplishment by computer facilities.
I know of no recent squabbles where some people claim others are
hogging the resources. This is in sharp contrast with ten years
ago.
2. There are still some shortages.
a. What some people want to do imposes immoderate
requirements on speed, memory size or graphics.
b. Disk space is still expensive enough so that some
people delete report files when they leave --- even though
we now have library areas for them.
c. Not everyone who wants one has a home terminal.
d. The facilities for working with extended character
sets are poor.
e. The present workstations lack certain important
programs, e.g. Lisp and Tex.
d. Not everyone has even a terminal on his desk.
e. Many have no desk who should. For many this
limitation is more important than compute limitations.
3. The babble over dinosaurs not withstanding, many who have
the financial resources to do otherwise continue to do most
of their computing on the time-shared machines. There are
a variety of reasons in my case.
a. Inertia. For most of what I do, writing, there is
no obvious advantage.
b. I have compatible facilities at home and in my office.
c. Neither terminal is bulky, contains a fan, or emits
significant heat.
d. Lisp and a variety of document compilers are available.
e. I, personally, don't have to worry about maintenance.
f. My tens of megabytes of personal files are backed up.
At least I haven't lost any since 1969.
g. Whenever I have made inquiries about getting facilities
with a larger screen, one or more of the preceding lacks has
persuaded me to wait a while longer.
Most of the senior faculty is not inclined to change at
present even though we could get the resources.
4. Perhaps I would benefit greatly by changing. Who at Stanford
has the very best facilities at home and in the office? What are
they? Can I get them just for money, i.e. without doing maintenance
myself either of hardware or of files? This question is addressed
to the faculty dinosaur baiters, e.g. Vaughan Pratt and Brian Reid.
5. Assuming SCORE is crowded, we should accept the additional 20
offered by DARPA.
∂13-Feb-85 0931 JMC police arrest hacker
To: su-bboards@SU-AI.ARPA
Those who object to the use of the word hacker to mean
"password hacker" have their opportunity. Yesterday's
Stanford Daily has a headline "police arrest hacker".
There will be a demonstration picketing the Stanford
Daily Friday noon. Regrettably, I will be out of town.
∂13-Feb-85 1415 JMC re: Chess and EKL
To: restivo@SU-SCORE.ARPA
∂13-Feb-85 1149 RESTIVO@SU-SCORE.ARPA re: Chess and EKL
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 Feb 85 11:48:56 PST
Date: Wed 13 Feb 85 11:23:58-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
Subject: re: Chess and EKL
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 12 Feb 85 15:19:00-PST
[cwr] Is 14.2 before CS226 a good time to see you?
-------
I don't understand 14.2, but just before CS226 is never a good time
to talk to me.
∂13-Feb-85 1431 JMC reference
To: nilsson@SU-SCORE.ARPA
I want to refer someone to the SRI work on the program to guide
an apprentice mechanic repairing a carburetor. What is the best
publication reference and the best person reference?
∂13-Feb-85 1510 JMC avec Oliver
To: CLT
Tout sera comme tu propose. Le banquet finira environ nevf heures et
demi. Apres ca, nous viendrons ici.
∂13-Feb-85 1512 JMC paper from Math Library
To: RA
Please get me a paper by Heinrich Behmann in
Mathematische Annalen, vol. 86 (1922) pp. 163-229.
∂13-Feb-85 1643 JMC ARPA grant
To: YM
It's DARPA not ARPA, and it doesn't give grants; it makes contracts.
It can get them and us in difficulty with Congress if it seems that
the people supported by its contractors think they have grants. The
difference is that contractors have obligations to do whatever they
have contracted to do; grantees have no such obligations. Congress
requires and likes to think that research supported by DARPA is
directly related to defense. This is why some years ago the name
was changed to Defense Advanced Research Projects Agency.
∂14-Feb-85 0155 JMC two things
To: RA
1. I want to take the Behmann paper with me, so I'll need it by
11:30 as I'll leave directly from my class.
2. Please try to remind me about expenses and bills after trips.
I thought I had sent the expense report for the previous Austin
trip.
∂14-Feb-85 0938 JMC re: CS Search Committe
To: RA
[In reply to message rcvd 14-Feb-85 09:32-PT.]
Search committee date is ok. Thanks for the paper.
∂14-Feb-85 0952 JMC
To: rich@MCC.ARPA
n016 0746 14 Feb 85
BC-BROWN
By CORY DEAN
c.1985 N.Y. Times News Service
PROVIDENCE, R.I. - It has been a matter of pride to administrators
who were at Brown University in the 1960s that the campus survived
the turmoil of that time without major disruption.
''Brown was the only school in the Ivy League that did not call the
cops in the Vietnam era,'' says Robert A. Reichley, vice president
for university relations, who came to Brown in 1968.
But today, when much of the country is floating in what Reichley
calls a ''a sea of conservatism,'' students at Brown have attracted
wide attention with campus protests.
In October students voted to ask the university to stock suicide
pills for use in the event of nuclear war. Although the university
said from the outset that it would not consider stocking cyanide for
students, the referendum was praised by administrators, faculty
members and students who endorsed its message - that the arms race is
suicidal - and applauded its success in making the point to the
public.
In November, in an action that has divided opinion on campus,
several dozen students disrupted an appearance by recruiters from the
Central Intelligence Agency by attempting to put them under citizens'
arrest. The students said that the agency engaged in illegal
activity, citing such things as the mining of harbors in Nicaragua by
CIA-supported forces. They said recruiting people to commit crimes
was a crime itself.
But the university administration took the position that the protest
deprived the recruiters of their right to speak. The university
issued formal warnings to all the undergraduate students who took
part and made the warnings part of their permanent records.
To some the university appears to be caught in a time warp. But
although many of the students involved in the demonstrations wear the
long hair and armbands of the 1960s, they reject the analogy and
repudiate the methods and rhetoric of the Vietnam era.
''People use that nostalgia line to discredit anything that goes
against the status quo,'' said Juliet M. Brodie, a senior who was
among the leaders of the CIA protest.
Although the university administration disagrees, she and others in
the group described the attempted arrest as a carefully thought-out
effort to combat what they believe to be criminal activity.
''This has been consistently seen as some form of street theater,''
Miss Brodie said, angry that the protest has been compared to
confrontations of 20 years ago. ''This was not just a protest, it was
a citizens' arrest!''
Jason Salzman, an organizer of the suicide referendum, said the
tactics of the 60s carry a ''stigma'' of ineffectiveness. ''People
have chanted, 'Up against the wall!' and nothing happens,'' he said.
''Even people who sympathize realize that approach was used and may
not be effective.''
He said he believed asking students to vote on the suicide pill
referendum would compel them to ''confront the issue in a more
personal way'' than did rallies and protest marches in the 60s.
William G. McLoughlin, a professor of history who was active in the
antiwar movement of the 60s, said the students involved in protests
at Brown today were ''far from the 'stop the world, I want to get
off' people of the 60s, the people who wanted to get out and march
for Martin Luther King or picket for grapes.'' He said most today
planned professional careers.
At their disciplinary hearing, a nine-hour proceeding, the students
charged with disrupting the CIA recruiters presented the results of
their research on citizens' arrests. They brought two lawyers to
testify on the subject.
Sandor Katz, a senior who was one of the CIA protesters, said the
group learned from the example of the 60s: ''They didn't do the kinds
of things we did in terms of research.''
Administrators, professors and students alike have no ready
explanation for what appears to be an unusual level of activism at
Brown.
Howard R. Swearer, Brown's president, attributed much of this
impression to the fact that Brown gets ''more media attention.''
Reichley agreed. ''We have extremely high visibility,'' he said.
The students say their reasons are individual, based on their
experiences before getting to college. Katz said he first went to
demonstrations as an infant, carried by his parents.
Miss Brodie attributed some of her activism to her mother's
involvement in the peace movement. ''There are 67 different
stories,'' said Lisa Krakow, a CIA protester, alluding to the number
of students cited at the hearing.
Salzman cited a factor many on campus offered as a possible
explanation, the university's curriculum, which was adopted after
months of student agitation in the 60's. It allows students unusual
freedom to design their own programs.
''I came to this school because of the curriculum,'' he said. ''The
curriculum attracts people who might be interested in taking
responsibility for their own education so they are taking
responsibility for much larger things.''
nyt-02-14-85 1046est
***************
∂14-Feb-85 1116 JMC another but final delay
To: les-here
CC: CLT
I am taking the proposal draft to Texas with me and will read it.
Carolyn will read it while I'm away. We'll be ready to discuss
it Monday.
∂15-Feb-85 1018 JMC $400K
To: nilsson@SU-SCORE.ARPA
CC: EAF@SU-AI.ARPA
Our budget will not presume use of the $400k. We'll have to see
what position Kahn takes.
∂15-Feb-85 1023 JMC
To: JJW
Simplifying QLAMBDA is a good thing to try.
∂16-Feb-85 0856 JMC
To: ME
;u
∂16-Feb-85 0856 JMC
To: ME
Previous message a misprint in using NS.
∂17-Feb-85 2046 JMC reply to message
To: RESTIVO@SU-SCORE.ARPA
[In reply to message sent Sun 17 Feb 85 20:10:47-PST.]
My paper contains a reference to Kelly's, and I think I have copies.
I don't know about more recent related work, but I think there is
quite a lot. Professor Arrow in Economics might know about it.
∂17-Feb-85 2046 JMC
To: CLT
I'm back.
∂17-Feb-85 2051 JMC re: Forsythe Lecturer '86
To: NILSSON@SU-SCORE.ARPA
[In reply to message sent Thu 14 Feb 85 13:33:31-PST.]
If it doesn't have to be one of our own PhDs I would suggest Bob Boyer.
Not exactly apropos of that, it occurred to me that we might ask the
deanery for a regular visiting professorship. We could use it for
mutual inspection of possible professors. Boyer, Kowalski, Colmerauer,
Bledsoe, Tom Mitchell and others are possible invitees.
∂18-Feb-85 1055 JMC moving your stuff
To: SMC
You have piled excuse upon excuse. Please move the stuff within one
business day of the time you get this message.
∂18-Feb-85 1056 JMC p.s
To: SMC
All of it.
∂18-Feb-85 1059 JMC re: industry lectureship
To: Bobrow.pa@XEROX.ARPA
[In reply to message sent 18 Feb 85 10:07 PST.]
I'll check with CSLI. That's the likely source.
∂18-Feb-85 1103 JMC use of dandelions for a course
To: john@SU-CSLI.ARPA
Dan Bobrow and so far unnamed Xerox colleagues are considering accepting
my invitation to give an industry lectureship course for one quarter
next year. They ask,
"A number of us are considering some sort of joint course. Are there
Dandelions available for us to use if we wanted to make a project
course?"
Could CSLI Dandelions be used? I need to settle everything about this
course in time to meet the Feb. 28 deadline for next year's Courses
and Degrees.
∂18-Feb-85 1110 JMC
To: RA
Bledsoe's address is MCC now not U. Texas.
∂18-Feb-85 1115 JMC
To: RA
resnic.1
∂18-Feb-85 2241 JMC qproposal
To: CLT
I have done minor additional tinkering.
∂19-Feb-85 0750 JMC
To: CLT, les-here
Yes, add the grad student names.
∂19-Feb-85 1139 JMC re: use of dandelions for a course
To: JOHN@SU-CSLI.ARPA
[In reply to message sent Mon 18 Feb 85 21:36:31-PST.]
Thanks John. I'll relay the information to Bobrow, and when the plans
become more concrete, we can talk further. The reimbursement part
seems proper to me, and we can raise it with H&S when the proposal
becomes concrete.
∂19-Feb-85 1141 JMC Dandelions
To: bobrow.pa@XEROX.ARPA
John Perry is "sure it can be worked out". I need a course description
in the next week.
∂19-Feb-85 1300 JMC interview
To: llw@S1-A.ARPA
I have been interviewed in two sessions. They predict some
action in two to four weeks.
∂19-Feb-85 1456 JMC re: AI and genetics
To: RA
[In reply to message rcvd 19-Feb-85 13:11-PT.]
I believe Peter Friedland did a thesis on the subject. If he isn't
still around Stanford ask Mike Genesereth who would be a good person
to talk to.
∂19-Feb-85 1511 JMC re: Circumscription seminar
To: RA
[In reply to message rcvd 19-Feb-85 15:04-PT.]
SRI - AI Center
IBM - Joe Halpern
Xerox - Daniel Bobrow
HP - Ira Goldstein
Fairchild - Marty Tenenbaum, I guess it's now called Schlumberger.
Maybe they have all the addresses at HPP or in the CSD office.
Joe Halpern's is in my phon file.
∂19-Feb-85 1601 JMC re: prereq for 258
To: DEK
[In reply to message rcvd 19-Feb-85 15:43-PT.]
157A will be ok, especially as I probably won't teach 258 next year
anyway - not if my proposal for a VTS course is accepted.
∂19-Feb-85 1625 JMC
To: SMC
You need to get medical insurance. This week.
∂19-Feb-85 1645 JMC
To: RA
Both dates are for DOE security interviews in Oakland.
∂19-Feb-85 1805 JMC reply to message
To: EJS
[In reply to message rcvd 19-Feb-85 17:56-PT.]
Do you want a "to whom it may concern" letter or one to specific people?
Recipients prefer the latter.
∂20-Feb-85 0104 JMC
To: CLT
Kronos
∂20-Feb-85 0108 JMC re: CSD Facilities meeting
To: cheriton@SU-PESCADERO.ARPA
[In reply to message sent Tue, 19 Feb 85 22:59:10 pst.]
I can make it but will have to leave early for an Academic Senate
meeting.
∂20-Feb-85 1945 JMC re: Michael Green
To: NILSSON@SU-SCORE.ARPA
[In reply to message sent Wed 20 Feb 85 11:46:02-PST.]
I am rather sure that we didn't give a PhD in 1966 to a Michael Green.
∂20-Feb-85 2217 JMC
To: ME
tty exist 16 doesn't seem to revive the AP.
∂21-Feb-85 1028 JMC re: Austin trip December
To: RA
[In reply to message rcvd 21-Feb-85 09:34-PT.]
The December trip was one day at $1,000. They paid all Austin expenses
and transportation, so the only expenses are air fare, parking in San
Jose and car trip to San Jose.
∂21-Feb-85 1126 JMC $100K
To: RPG
Said funds arrived to support "portable common lisp" through 3/31/85.
∂21-Feb-85 1130 JMC
To: RWW
We proposed for each person one two week trip for each of two years.
∂21-Feb-85 1229 JMC
To: RA
Please get what organization callers are from and ask what it's about. Had I
known what it was about I wouldn't have returned the call from King.
∂21-Feb-85 1241 JMC
To: RA
adams.2[let,jmc]
∂21-Feb-85 1253 JMC re: adams.2
To: RA
[In reply to message rcvd 21-Feb-85 12:52-PT.]
Yes, his address is in the Stanford Directory.
∂21-Feb-85 1444 JMC re: CSLI Summer School and ASL Meeting
To: INGRID@SU-CSLI.ARPA
[In reply to message sent Thu 21 Feb 85 14:31:54-PST.]
The title is "Formalized non-monotonic reasoning with applications
to artificial intelligence". You might run this by Jon in case we
agreed on something different or he would prefer something different.
∂21-Feb-85 2052 JMC
To: HST
Did you know this man?
a287 2044 21 Feb 85
AM-Spy Plea,0350
East German Pleads Guilty To Espionage
By BART ZIEGLER
Associated Press Writer
BOSTON (AP) - An East German college professor pleaded guilty
Thursday to charges that he paid a U.S. Navy employee $21,800 for
classified defense documents which authorities said posed no threat
to national security.
Alfred Zehe, 45, of Dresden, faces a possible life sentence and
$40,000 fine when he is sentenced April 4.
Zehe originally pleaded innocent to charges contained in an
eight-count federal indictment returned in November 1983. He has been
free since the East German government posted $500,000 cash bail in
June 1984, and remains free.
He was arrested on Nov. 3, 1983, while attending a scientific
conference at a Boston hotel. He contended he was merely a college
professor, while U.S. authorities said he was a highly trained spy.
Zehe admitted in federal court Thursday that he conspired with
others to deliver classified U.S. defense information to East German
authorities in April, May and July 1983.
''I agree that this was what happened,'' Zehe told U.S. District
Judge David W. Nelson in accented English after the judge read the
indictment.
According to the indictment, Zehe first met with the unidentified
civilian Navy employee in Mexico City in October 1982, paid him
$1,500 and requested secret documents dealing with military
technology.
Unknown to Zehe, the Navy employee was cooperating with the FBI and
Naval authorities.
The indictment charged that Zehe provided the Navy employee with a
movie camera and film that had been modified to photograph documents.
Zehe met with the Navy worker seven times between October 1982 and
July 1983 to exchange documents and cash. The meetings, in both
Mexico City and East Berlin, were held under the direction of East
German intelligence authorities, according to the indictment.
In a Jan. 29 opinion, Nelson found that the charges should stand
even though the alleged espionage took place outside the United
States. Zehe's attorneys argued the location of the offenses
invalidated the indictment.
Zehe testified Thursday he holds a doctorate degree and has been a
professor at the Technical University of Dresden since 1980.
AP-NY-02-21-85 2340EST
***************
∂22-Feb-85 1138 JMC re: SunNet
To: TAJNAI@SU-SCORE.ARPA
[In reply to message sent Fri 22 Feb 85 11:37:35-PST.]
I am not involved with SunNet and therefore decline.
∂22-Feb-85 1202 JMC re: SunNet
To: TAJNAI@SU-SCORE.ARPA
[In reply to message sent Fri 22 Feb 85 11:43:11-PST.]
If I were organizing it, I would telephone Ralph Gorin and ask his advice -
also David Cheriton.
∂22-Feb-85 1405 JMC A Center for ...
To: JEF@SU-AI.ARPA
CC: CLT@SU-AI.ARPA
Just a remark about the chain of arrows on the first page. From
Carolyn's and my point of view the relations are more complex
than suggested by arrows going in one direction. Much of the
work described in the proposal starts with hardware ideas about
efficient parallel computation and then hopes that the resulting
machine will be usefully programmable. Illiac 4 was so motivated.
HPP proposes to start with applications. We are planning to
start with a language - QLAMBDA - and work in both directions.
Depending on the actual scientific situation any of these
approaches may be appropriate or lead to disaster especially
if pursued in too pig-headed a way.
This remark is not especially apropos of the proposed center,
except that no one approach should be allowed to dominate it.
For quite other reasons, however, I'm somewhat skeptical of
the value of grand centers.
∂22-Feb-85 1837 JMC re: terminals and RF interference (from SAIL's BBOARD)
To: OTHER-SU-BBOARDS@SU-AI.ARPA
jmc - You can legitimately complain to HP about TV interference,
because it means that the terminal is not in compliance with
FCC regulations.
∂23-Feb-85 1605 JMC re: Alan Kay
To: NILSSON@SU-SCORE.ARPA
[In reply to message sent Sat 23 Feb 85 13:29:59-PST.]
I conversed with Alan Kay's answering machine. We have the required
three for next year, John Williams, Fernando Pereira and a combination
of Dan Bobrow and Mark Stefik. However, there is no law saying it has
to be exactly three, although we would need a bit more money and also
there might be a limit on student demand for this kind of course. I
agree that Halpern is good. It occurs to me, however, that Fernando's
course might be a better candidate to be a regular course, since much
of his catalog statement amounts to a regular course on logic programming.
∂23-Feb-85 1650 JMC re: Alan Kay
To: NILSSON@SU-SCORE.ARPA
[In reply to message sent Sat 23 Feb 85 16:49:05-PST.]
Agreed.
∂23-Feb-85 1930 JMC vip
To: nilsson@SU-SCORE.ARPA
You might not know that we cannot call them visiting professors in
any formal document. Stanford has a rule that a visiting professor
must have a professorial appointment somewhere else. Perhaps it
is related to people climbing into the academic world via visiting
appointments which do not get the scrutiny given to regular appointments.
∂23-Feb-85 2038 JMC re: counterfactuals
To: SJG
[In reply to message rcvd 22-Feb-85 10:26-PT.]
I'll probably come. Have you seen Barwise's opus on conditionals
and conditional information. It's a CSLI report. He has some
examples that are worth thinking about.
∂25-Feb-85 1034 JMC re: counterfactuals
To: SJG
[In reply to message rcvd 25-Feb-85 10:29-PT.]
Are you interested in dinner tonight? Carolyn is in Texas.
∂25-Feb-85 1037 JMC re: dinner
To: SJG
[In reply to message rcvd 25-Feb-85 10:34-PT.]
Tomorrow is not possible. How about Wednesday in any case?
∂25-Feb-85 1302 JMC Nilsson
To: ohlander@USC-ISI.ARPA, nilsson@SU-SCORE.ARPA
After I hung up, it occurred to me that Nils Nilsson is a possibility
for the Stanford user of the connection machine. Now that he has
settled in (very successfully in my opinion) as department chairman,
he wants to get some research activity started. Since he will be
starting something new and the connection machine is new, the
possibility of a fit might be explored. I went to look for him,
but he wasn't in. The only reason for sending this message before
I talk to him is that if you are sending someone a message about
literature, you might ask to have him sent a packet also.
∂25-Feb-85 1320 JMC connection machine
To: nilsson@SU-SCORE.ARPA
Ron Ohlander phoned me to ask whether Stanford wants one. I said
I was prejudiced against it because I'd heard it was SIMD, and
he said it wasn't exactly. I said that I might overcome my
prejudices if I saw the literature, and he said he'd get them
to send the literature to me and Feigenbaum. After the conversation
it occurred to me that he should send literature to you also. No
harm it getting DARPA used to the idea of giving you money in
your new incarnation even if the connection machine turns out
not to be interesting to you.
∂25-Feb-85 1429 JMC industry
To: DKE
Stefik promises copy today by net mail. The quarters will be
(Pereira, Fall) Williams, Winter) (Bobrow et al, Spring)
I'll MAIL you the full information this afternoon or tomorrow morning.
∂25-Feb-85 1450 JMC
To: DKE
Prolog and Natural Language Analysis
Introduction the logic programming language Prolog as a tool for
natural language analysis and related topics in Artificial
Intelligence. Prolog concepts and programming techniques will be
introduced through a progression of natural language analysis
examples. No previous experience with logic programming or natural
language analysis is required. The following topics will be
discussed: representing context-free grammars in Prolog; definite
clause grammars; the logical variable; difference lists; top-down
parsing and the Prolog execution model; syntactic analysis of complex
constructions; semantic translation rules and logical form; general
computations in grammars; structure manipulation and multistage
analysis; operations on logical forms; deductive question-answering in
Prolog; metalevel computation and the embedding grammar formalisms in
Prolog; extralogical operations; implementation of alternative parsing
algorithms; the organization of a natural-language question-answering
system. Examples will be available as running Prolog programs and
will be used for exercises. Prerequisites: elementary notions of
logic, formal language theory and symbolic computation.
∂25-Feb-85 1637 JMC acknowledgment
To: williams%ibm-sj.csnet@CSNET-RELAY.ARPA
The course description (MAILed at 14:51) arrived at 15:50. Thanks.
∂25-Feb-85 1637 JMC FP course description
To: DKE
∂25-Feb-85 1550 williams.sjrlvm1%ibm-sj.csnet@csnet-relay.arpa FP course description
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 25 Feb 85 15:49:41 PST
Received: from ibm-sj by csnet-relay.csnet id ao15561; 25 Feb 85 18:36 EST
Date: Mon, 25 Feb 85 14:51:02 PST
From: John Williams <williams%ibm-sj.csnet@csnet-relay.arpa>
To: JMC@SU-AI.ARPA
Subject: FP course description
Functional Programming -- Current research topics in the design and
implementation of functional programming languages, including formal
semantic models, rewriting rules and the algebra of programs, abstract
data types, program transformations, infinite sequences,
and the use of stream-valued stream
functions to accommodate persistent memory and interactive I/O. The
particular language FP will be studied in depth, with examples drawn
from other functional languages such as SASL, ML, KRC, and Hope.
Prerequisite: a graduate-level course in programming languages.
(Williams) by arrangement .
∂25-Feb-85 2045 JMC
To: DKE
Somehow it seems unlikely that Stefik will come through tonight. Sorry.
∂25-Feb-85 2207 JMC re: Software development proposal
To: JJW
[In reply to message sent 25 Feb 85 2200 PST.]
There is little doubt that we can spend capital money on software. In
fact part of the DARPA equipment contract (All DoD money is in contracts
not grants) is budgeted for software, and, according to Len, this money
hasn't been used. I'd like to emphasize that there should be specific
software projects with specifications before capital money is budgeted.
Otherwise I agree with your writeup.
∂25-Feb-85 2209 JMC re: Software development proposal
To: JJW
[In reply to message sent 25 Feb 85 2200 PST.]
However, the mention that those who don't pay won't benefit should
perhaps be de-emphasized. It is likely to result in the meeting
being occupied with various forms of recrimination about who promised
to do what and didn't.
∂26-Feb-85 0002 JMC
To: pournelle@MIT-MC.ARPA
n119 2211 25 Feb 85
BC-AUTHORS 2takes
(Science Times)
By WILLIAM J. BROAD
c.1985 N.Y. Times News Service
NEW YORK - Science-fiction writers are engaged in a war of words
over whether governments should stress peace or war in the
development of space.
What makes their debate of more than literary interest is that
writers of science fiction have been so prescient. Over the past
century they foretold the advent of radio, television, tanks,
helicopters, atom bombs, moon rockets, computers, robots and
satellites.
Now they are split into camps that either support the Reagan
administration's Strategic Defense Initiative, the so-called ''Star
Wars'' defense against intercontinental missiles, or urge
alternatives such as cooperation in space with the Soviet Union.
As befits their status as 20th-century seers, they and their
opinions are being accorded careful attention by powerful individuals
in and out of government, including President Reagan. ''People are
listening to science-fiction writers more than they did,'' said James
Gunn, an expert in the genre at the University of Kansas. ''An
element of soapbox missionary work has existed in science fiction
back to the days of H.G. Wells and Jules Verne. But today authors
like Asimov, Clarke and Heinlein have become credible advocates
because, as Asimov says, we live in a science-fiction world and
people are just starting to realize it.''
Recently the authors Robert A. Heinlein and Jerry Pournelle have
been promoting the ''High Frontier'' proposed by army Lt. Gen. Daniel
O. Graham, retired, in which hundreds of orbiting battle stations,
some manned, would be used to shoot down enemy missiles.
In addition, Pournelle and Dean Ing are co-authors of a recent book,
''Mutual Assured Survival,'' an outline for space defense that Reagan
hailed as ''addressing with verve and vision the challenges to peace
and to our national security.''
On the other side of the debate is Arthur C. Clarke, who has
testified in Congress against ''Star Wars'' and on behalf of peaceful
missions with the Russians to such places as Mars. A colleague who
has joined his crusade is Isaac Asimov, who recently quit the board
of governors of the L-5 Society, a space lobbying organization,
because it would not take a firm stand against missile defense.
''I don't think 'Star Wars' is feasible and I don't think anybody
takes it seriously,'' Asimov said in an interview. ''It's just a
device to make the Russians go broke. But we'll go broke too. It's
very much a John Wayne standoff.''
By some estimates, space-based defense could cost as much as $1
trillion, about five times as much as recent federal budget deficits.
''The community is divided over this thing,'' said Dr. Robert A.
Collins, editor of Fantasy Review, a magazine devoted to the study of
science fiction.
The dispute centers on the Reagan administration's proposal to spend
$30 billion over five years for research into the feasiblity of
creating a defense to shoot down enemy missiles. Its forerunner was
Graham's ''High Frontier'' proposal, first put forth in 1982.
Science fiction authors are divided not only on the feasibility of
the idea but also on how space in general should be developed,
according to Collins, a professor at Florida Atlantic University.
Advocates of ''Star Wars'' believe that the best way to speed the
evolution of all kinds of space technologies is with the aid of the
military, he said.
Detractors see such military involvement as soaking up all the money
for real space exploration. ''They think of space as a pioneering
thing,'' Collins said. ''They don't see a ring of weapons as anything
more than a barrier to that.''
Clarke, author of such books as ''2001: A Space Odyssey'' and
''2010: Odyssey Two,'' called plans for a space shield ''technolgical
obscenities'' and said that instead the American government should
emphasize cooperative missions with the Soviet Union. ''I am not so
naive as to imagine that this could be achieved without excruciating
difficulty and major changes in the present political climate. But
those changes have to be made, sooner or later.''
One of the more outspoken ''Star Wars'' advocates is Pournelle,
co-author with Larry Niven of such books as ''Lucifer's Hammer'' and
''The Mote in God's Eye.''
''The historic role of the military is to build roads to new
frontiers and protect early settlers,'' Pournelle said in an
interview. ''Today this is one of the best ways to get into space.
This is the deepest pocket. But I support SDI for lots of other
reasons than that.''
''The strategy of assured survival is better than assured
destruction,'' he said, meaning that it is better to try to shoot
down attacking missiles rather than to have the superpowers held
hostage to the destructive power of each other's missiles.
''If we had 100 of General Graham's boost-phase interceptors in
orbit with five or six American service people aboard each one,''
Pournelle said, ''we would have a much less ambiguous warning system
of attack on this country. I keep hearing all this talk about not
militarizing space. But the oceans have been militarized for a long
time and that hasn't forestalled their use by civilians.''
Recently the debate over ''Star Wars'' spilled into Science Fiction
Chronicle, a magazine that publishes the reflections of
science-fiction authors.
''Over the last year or two I've heard a good many of my colleagues,
including some who in previous encounters seemed quite sane, tell me
that they really thought this 'Star Wars' thing was a pretty good
idea,'' wrote Frederik Pohl, author of such books as ''Midas World''
and ''The Space Merchants.''
In a subsequent issue, Pournelle replied, ''We all love Fred Pohl,
but I do wish he'd stop talking nonsense.''
In an interview Pohl said that what upset him ''is that most of the
authors supporting 'Star Wars' are not cold warriors but people who
want to trick the military into spending money on space.''
''I do wish we had not canceled some of the space program,'' Pohl
added. ''We should have a base on the Moon, a manned landing on Mars
and cooperative programs with the Soviets.''
Not all authors are taking sides. ''I'm somewhere in between,'' said
Ray Bradbury, author of such books as ''Fahrenheit 451'' and
''Illustrated Man.'' ''We're trapped by circumstance, aren't we?
Everybody has forgotten that Russia helped start the Second World
War. And she's occupied all those countries for more than 40 years.
Those are realities. That puts us pacifists in a quandary.''
nyt-02-26-85 0112est
***************
∂26-Feb-85 1033 JMC re: metabullism (from SAIL's BBOARD)
To: OTHER-SU-BBOARDS@SU-AI.ARPA
jmc - I prefer monologs from Vaughan to dialogs from him. Worse yet would
be whole symposia from him or others. Brian, be careful what you ask for.
∂26-Feb-85 1051 JMC re: I got Stefik's note just in time, and...
To: DEK
[In reply to message rcvd 26-Feb-85 10:35-PT.]
Let it be LISP. The acronym criterion hadn't occurred to me, and I
have been dithering.
∂26-Feb-85 1053 JMC thanks
To: stefik.pa@XEROX.ARPA
The two copies of your message arrived within 30 seconds of each other.
However, the second made it first into my mail file. The content seems
fine.
∂26-Feb-85 1106 JMC apology
To: LEP
I owe you an apology for never calling a meeting but just doing it
again. I just finished the last bit of it. For a long time there
weren't any applicants, but a little beating the bushes got the
required number. Fernando Pereira of SRI will talk about logic programming
and natural language in the Fall. John Williams of IBM will talk
about functional programming in the Winter. Daniel Bobrow, Mark
Stefik and others from Xerox will talk about AI languages in Spring.
My excuse is that I never asked for a committee in the first place,
and in matters like this it's more work to divide up the work than
to just do it.
∂26-Feb-85 1107 JMC for announcement of Industrial Lectureships
To: DKE
When convenient, please MAIL me the final copy of the Industrial Lectureship
course announcements. I'll get out an announcement, perhaps with
biographical material, to the faculty and bboards.
∂26-Feb-85 1111 JMC industrial lectureships
To: nilsson@SU-SCORE.ARPA
The industrial lectureships for next year are
1. Fall, Fernando Pereira
2. Winter, John Williams on functional programming
3. Spring, Dan Bobrow, Mark Stefik and other Xeroxen on languages for AI
There will be an announcement to faculty and bboards with the course
descriptions and biographical material later.
To whom do wish to delegate making arrangements with the lecturers about
pay etc. The rule, which they know, has been to pay them $3,000 or
1/16 of annual salary, whichever is less. Sometimes, someone (not me)
has persuaded the employer to donate their services. This year, the
money for Joe Halpern's services was paid to IBM in accordance with
a contract someone (not me) negotiated. My part of the matter has
been to find the lecturers, schedule the quarters, and extract the
catalog statements.
∂26-Feb-85 1514 JMC re: [NAVARRO@SRI-AI.ARPA: missing keys]
To: navarro@SRI-AI.ARPA
[In reply to message sent Tue 26 Feb 85 15:05:45-PST.]
I still have it and have used it recently to come to seminars.
∂27-Feb-85 0913 JMC Oliver problem
To: restivo@SU-SCORE.ARPA
Companion to Concrete Mathematics, Z. A. Melzak, Wiley 1971.
sqrt(lambda x.x**2-2) = lambda x.[((x+sqrt(x**2-4))/2)**sqrt(2)
+ ((x-sqrt(x**2-4))/2)**sqrt(2). See p.54, example d.
∂27-Feb-85 0933 JMC
To: les-here
Kahn is expected back tomorrow evening.
∂27-Feb-85 1357 JMC
To: RA
Pls tell John Nafeh 11am or after 3pm, his choice.
∂27-Feb-85 1906 JMC [WALDINGER@SRI-AI.ARPA: talk by mike gordon, 3/6, 4:15, el381]
To: CLT
∂27-Feb-85 1705 EMMA@SU-CSLI.ARPA [WALDINGER@SRI-AI.ARPA: talk by mike gordon, 3/6, 4:15, el381]
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 27 Feb 85 17:05:09 PST
Return-Path: <WALDINGER@SRI-AI.ARPA>
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Wed 27 Feb 85 16:05:49-PST
Date: Wed 27 Feb 85 16:03:18-PST
From: WALDINGER@SRI-AI.ARPA
Subject: [WALDINGER@SRI-AI.ARPA: talk by mike gordon, 3/6, 4:15, el381]
To: friends@SU-CSLI.ARPA
ReSent-Date: Wed 27 Feb 85 16:55:28-PST
ReSent-From: Emma Pease <Emma@SU-CSLI.ARPA>
ReSent-To: friends@SU-CSLI.ARPA
that's 333 ravenswood avenue, menlo park.
---------------
Mail-From: WALDINGER created at 27-Feb-85 15:53:09
Date: Wed 27 Feb 85 15:53:09-PST
From: WALDINGER@SRI-AI.ARPA
Subject: talk by mike gordon, 3/6, 4:15, el381
To: bboard@SRI-AI.ARPA, zm@SU-AI.ARPA, ashcroft@SRI-CSL.ARPA,
AIC-Associates: ;
cc: CSL: ;
speaker: michael gordon, cambridge university, england
topic: hardware verification and higher-order logic
time: wednesday, march 6, 4:15pm
place: csl small conference room, el 381, building e,
sri international (visitors from outside please
come to the lobby
preceded by: coffee in richard waldinger's office
abstract: to be concocted
-------
-------
∂27-Feb-85 2203 JMC
To: RA
americ.1
∂27-Feb-85 2257 JMC re: "Hail, Anubis, . . . "
To: LLW@S1-A.ARPA
[In reply to message sent 27 Feb 85 2253 PST.]
In 70 years one can accumulate a lot of sins - some of mine are prenatal.
Thanks again, and I hope that if it all works out I can do something
helpful to your enterprises.
∂28-Feb-85 0945 JMC re: Bob Kahn getogether
To: FEIGENBAUM@SUMEX-AIM.ARPA
[In reply to message sent Thu 28 Feb 85 00:30:00-PST.]
Dinner yes.
∂28-Feb-85 0951 JMC
To: JMC
Technical Report 5172:TR:85
Caltech Computer Science
Caltech 256-80
Pasadena, CA 91125
Unfortunately, they charge $4 for a copy!
∂28-Feb-85 1200 JMC
To: ME
esp seems to be down
∂28-Feb-85 1212 JMC
To: ME
esp was just slow.
∂28-Feb-85 1253 JMC re: Speech recognition
To: RA
[In reply to message rcvd 28-Feb-85 11:36-PT.]
I don't think anyone at Stanford is working in that area now.
Raj Reddy at CMU is the best reference I can give.
∂28-Feb-85 1255 JMC re: Thursday is upon us!
To: SJG
[In reply to message rcvd 28-Feb-85 12:49-PT.]
Yes. How about meeting here at 6. Later is also ok.
∂28-Feb-85 2234 JMC
To: reges@SU-SCORE.ARPA
wrong MAIL address
Apparently you or someone has entered me as JMC-LISTS@SCORE in the
FACULTY@SCORE mailing list. It should be JMC-LISTS@SU-AI.
∂28-Feb-85 2236 JMC re: Mail problem
To: cheriton@SU-PESCADERO.ARPA
[In reply to message sent Thu, 28 Feb 85 20:04:35 pst.]
Thanks. It should be JMC-LISTS@SU-AI, and I have requested Reges to fix it.
∂28-Feb-85 2240 JMC reply to message
To: REGES@SU-SCORE.ARPA
[In reply to message sent Thu 28 Feb 85 22:38:56-PST.]
Thanks.
∂01-Mar-85 1119 JMC re: Abstract for Summer School
To: INGRID@SU-CSLI.ARPA
[In reply to message sent Fri 1 Mar 85 10:16:43-PST.]
Deduction in mathematical logic is monotonic in the sense that a
conclusion deduced from a set of premisses is also deducible from
any enlarged set of premisses. Human reasoning is often non-monotonic
drawing prima facie conclusions from the ``simplest model'' of the
facts taken into account. These conclusions may be withdrawn when
more facts become available even if the new facts don't contradict
the old. Since the middle 1970s, researchers in artificial intelligence
have found it useful to formalize certain kinds of non-monotonic
reasoning using the tools of mathematical logic. Applications have
been made to the theory of databases, to inheritance hierarchies
with exceptions, to solving the frame problem and to planning generally.
The lectures will cover both the formal theory and applications to AI
with emphasis on the circumscription method of non-monotonic reasoning.
∂02-Mar-85 2209 JMC re: any literature on history of ideas in Computer Science ? (from SAIL's BBOARD)
To: OTHER-SU-BBOARDS@SU-AI.ARPA
jmc - The best you can do on the history of computer science thought is to
look at the Annals of the History of Computing journal. Historical books
are reviewed in it.
∂03-Mar-85 1023 JMC
To: aaai-office@SUMEX-AIM.ARPA
Council members
Claudia,
Let me remind you that you promised me a list of people who
have been or are Council members so I can use it to suggest nominees.
I need when they served also. As far as I'm concerned there's no
great hurry, but I'll need it well in advance of the time when you'll
want names from me.
John
∂03-Mar-85 1547 JMC
To: RA
ap.1
∂03-Mar-85 1549 JMC
To: JJW
Try crypto #40, taken from "Elementary Cryptanalysis" by Helen Gaines.
∂04-Mar-85 0050 JMC
To: VAL
Have you seen WARPLAN by David Warren? Generalized STRIPS in Prolog.
∂04-Mar-85 1226 JMC
To: RA
Pls. make Vladimir a copy of WARPLAN which you'll get from me.
∂04-Mar-85 1302 JMC
To: ME
We need instructions posted on putting paper in the Imagen.
∂05-Mar-85 0851 JMC photographer
To: RA
When she comes, ask if she would prefer a seminar room to my cluttered office.
∂05-Mar-85 0936 JMC re: Two Recommendations from the Conference Committee
To: AMAREL@RUTGERS.ARPA, AAAI-OFFICE@SUMEX-AIM.ARPA
CC: ai.woody@MCC.ARPA, Fikes@USC-ECL.ARPA, Brachman@SRI-KL.ARPA,
Davis%MIT-OZ@MIT-XX.ARPA, Genesereth@SUMEX-AIM.ARPA,
Buchanan@SUMEX-AIM.ARPA, Engelmore@SUMEX-AIM.ARPA,
Lerman@SRI-KL.ARPA, MCdermott@CMU-CS-A.ARPA,
Reddy@CMU-CS-A.ARPA, Rich@MIT-MC.ARPA, Stan@SRI-AI.ARPA,
Shortliffe@SUMEX-AIM.ARPA, Stefik@XEROX.ARPA,
tenenbaum@SRI-KL.ARPA, PHW@MIT-MC.ARPA, hart@SRI-AI.ARPA
[In reply to message from AMAREL@RUTGERS.ARPA sent 5 Mar 85 09:58:34 EST.]
I agree with Saul that one conference is enough for the time being.
I think that it's better to let the President make co-operation
decisions with the advice of the Executive Director and Secretary-Treasurer
than to have a complex fixed policy. Finally, I agree with Mark Stefik
that we don't need a fixed term for the Secretary-Treasurer. Fixed
rules are needed when there are substantial conflicts within an
organization.
∂05-Mar-85 1134 JMC Steve Squires has our proposal
To: les-here@SU-AI.ARPA, CLT@SU-AI.ARPA, RPG@SU-AI.ARPA,
fateman@UCB-VAX.ARPA
The informal net version of our proposal was referred by Bob Kahn to
Steve Squires. He says it is "even better" than he remembered the
informal proposal Dick and I presented last summer. He likes the idea
of QLAMBDA with MACSYMA as a test vehicle. His main question concerns
the choice of machine. He wants us to preserve flexibility, and I told
him that Sequent was in only as an example. He may be inclined to add
more money to the hardware part in order to keep options open on machine.
He promises to get back to me in a week with further reaction. He suggests
that some personnel commitments will be reasonable when Bob Kahn sends
the request for an ARPA order.
∂05-Mar-85 1142 JMC
To: les-here@SU-AI.ARPA, CLT@SU-AI.ARPA, RPG@SU-AI.ARPA,
fateman@UCB-VAX.ARPA
I forgot to say above based on phone call to Squires.
∂05-Mar-85 1437 JMC re: Lisp Machine disk
To: JJW@SU-AI.ARPA, JMC@SU-AI.ARPA
CC: Bosack@SU-SCORE.ARPA
[In reply to message from JJW rcvd 05-Mar-85 12:42-PT.]
OK, let's do it.
∂05-Mar-85 1514 JMC re: Joseph Edozien
To: BUCHANAN@SUMEX-AIM.ARPA
[In reply to message sent Tue 5 Mar 85 14:58:12-PST.]
I have not agreed to supervise Edozien. He tried to persuade me, but
I don't find myself suitable to meet his requirements.
∂05-Mar-85 2237 JMC re: Summer plans
To: JJW
[In reply to message rcvd 05-Mar-85 21:16-PT.]
I expect to know in a week whether the Qlambda project will have money
by summer. If that seems unlikely, almost certainly I will be able
to support you anyway.
∂06-Mar-85 1216 JMC re: Job Reference
To: RTC
[In reply to message rcvd 06-Mar-85 12:07-PT.]
Yes.
∂06-Mar-85 2125 JMC re: dinosaurs
To: CL.BOYER@UTEXAS-20.ARPA
[In reply to message sent Wed 6 Mar 85 21:50:25-CST.]
Pratt still promises to do so, but no-one did. On the other hand, there
has been no more loose talk about dinosaurs.
∂07-Mar-85 1209 JMC re: Gaifman
To: STAN@SRI-AI.ARPA
[In reply to message sent Thu 7 Mar 85 11:45:01-PST.]
I don't know enough about Gaifman to have an opinion.
∂07-Mar-85 1838 JMC re: reference
To: CWR
[In reply to message rcvd 07-Mar-85 15:11-PT.]
%3McCarthy, John (1960)%1: "Programs with Common Sense," in Proceedings of the
Teddington Conference on the Mechanization of Thought Processes, Her Majesty's
Stationery Office, London.
common[e80,jmc]
∂08-Mar-85 1118 JMC re: Random events and queries
To: LES
[In reply to message rcvd 08-Mar-85 11:07-PT.]
1. I won't be there this afternoon, but go ahead, of course.
3. Rutie has a couple of copies of the Common Lisp Manual, but it's
just a reference manual.
4. There's Carolyn's and my book and Rutie can give you a copy. Just
inside my office is a bookshelf with a lot of LISP material. Also
ask Carolyn for suggestions.
∂08-Mar-85 1125 JMC
To: CLT
Les may ask you for advice on learning Lisp.
∂08-Mar-85 1207 JMC re: looking for you
To: RA
[In reply to message rcvd 08-Mar-85 11:38-PT.]
I will probably not be in until after 5pm, because I will be
at MAD this afternoon. I would very much like to see John Cocke
and would prefer to have been telephoned at home. I would come
in now if he were available and otherwise propose dinner. If he
reappears before 12:30 have him phone me at home, and if after 1pm
have him phone me at MAD. There I will be seeing John Nafeh.
∂08-Mar-85 1223 JMC
To: CLT
Are you in a mood to have dinner with John Cocke if he is retrievable?
∂08-Mar-85 1920 JMC
To: RA
Please pick up my mail and open it unless I get it first.
∂08-Mar-85 2113 JMC
To: ME
ap is down again
∂08-Mar-85 2124 JMC
To: ME
It's working now. Maybe there was just a large gap.
∂09-Mar-85 0044 JMC short job writing display programs
To: su-bboards@SU-AI.ARPA
Mikhail Bernstam of the Hoover Institution is looking for someone
to write or adapt some programs for displaying data. His
number is 497-0527.
∂09-Mar-85 1447 JMC reminder
To: reddy@CMU-CS-A.ARPA
I need Dan Resnick's home phone number and his net address.
∂09-Mar-85 1657 JMC talking in my class
To: barwise@SU-CSLI.ARPA
I have been talking all quarter in my class on Epistemological Problems
of AI about formalizing what a robot knows and the related reasoning in
first order logic. It occurs to me that it would be good for them to
hear a logician who thinks it's all a bad idea. The class meets from
1:15 to 2:30 in Room 241L (outer South side of Quad). There are two
remaining classes, this coming Tuesday and Thursday. Would you be
interested in coming to either or even both? You could lecture for
45 minutes, and then we could discuss the problems you see in using
logic for robots and the alternatives you see. The emphasis is entirely
on AI and not at all on natural language.
∂10-Mar-85 1210 JMC
To: CLT
Movie at 9:15. How about Susie too?
∂10-Mar-85 1508 JMC re: ijcai award
To: reiter%ubc.csnet@CSNET-RELAY.ARPA
[In reply to message sent Sun, 10 Mar 85 14:52:35 pst.]
Many thanks; I'm happy to be nominated. Biography follows.
∂10-Mar-85 1520 JMC Achievements:
To: reiter%ubc.csnet@CSNET-RELAY.ARPA
1. Invented Lisp language and directed first implementation.
1958.
2. Proposed use of logic for expressing common sense knowledge
and common sense reasoning and developed first formalizations of common
sense knowledge in logic including situation calculus. 1958
3. Made first (1957 informally, 1959 formally) proposals for
time-sharing computer systems.
4. Initiated work on proving that computer programs meet their
specifications including first theory of conditional expression and the
use of conditional expressions for representing recursive programs.
1961.
5. Proposed circumscription method of non-monotonic reasoning. 1977.
6. Proposed alpha-beta heuristic and killer heuristic for game playing.
1957.
∂10-Mar-85 1521 JMC biography
To: reiter%ubc.csnet@CSNET-RELAY.ARPA
.begin nofill
Biography of John McCarthy
.skip 2
BORN: September 4, 1927 in Boston, Massachusetts
EDUCATION:
B.S. (Mathematics) California Institute of Technology, 1948
Ph.D. (Mathematics) Princeton University, 1951
HONORS AND SOCIETIES:
American Academy of Arts and Sciences
American Society for the Advancement of Science
American Mathematical Society
Association for Computing Machinery
IEEE
Sigma Xi
Sloan Fellow in Physical Science, 1957-59
ACM National Lecturer, 1961
A. M. Turing Award from Association for Computing Machinery, 1971
Editorial Board, Artificial Intelligence Journal, 1975 - present
Academic Advisor, National Legal Center for Public Information, 1976 - 1980
Board of Directors, Information International, Inc., 1962 - present.
Board of Directors, Inference Corporation, 1983 - present.
Sigma Xi National Lecturer, 1977
Fellow, Center for Advanced Study in the Behavioral Sciences, 1979 - 1980.
President, American Association for Artificial Intelligence, 1983-84
PROFESSIONAL EXPERIENCE:
Procter Fellow, Princeton University, 1950-51
Higgins Research Instructor in Mathematics,
Princeton University, 1951-53
Acting Assistant Professor of Mathematics,
Stanford University, Sept. 1953 - Jan. 1955
Assistant Professor of Mathematics, Dartmouth
College, Feb. 1955 - June 1958
Assistant Professor of Communication Science,
M.I.T., 1958 - 1961
Associate Professor of Communication Science,
M.I.T., 1961 - 1962
Professor of Computer Science
Stanford University, 1962 - present
Director, Artificial Intelligence Laboratory
Stanford University, 1965 - 1980
PROFESSIONAL RESPONSIBILITIES AND SCIENTIFIC INTERESTS:
With Marvin Minsky organized and directed the Artificial
Intelligence Project at M.I.T.
Organized and directed Stanford Artificial Intelligence Laboratory
Developed the LISP programming system for computing with
symbolic expressions, participated in the development
of the ALGOL 58 and the ALGOL 60 languages. Present
scientific work is in the fields of Artificial
Intelligence, Computation with Symbolic Expressions,
Mathematical Theory of Computation, Time-Sharing computer
systems.
.end
.skip 3
∂10-Mar-85 1522 JMC .cb Publications
To: reiter%ubc.csnet@CSNET-RELAY.ARPA
%3McCarthy, John (1951)%1: "Projection Operators and Partial Differential
Equations" Ph.D. Thesis, Princeton University.
%3McCarthy, John (1952)%1: "A Method for the Calculation of Limit Cycles by
Successive Approximation" in %2Contributions to the Theory of Nonlinear
Oscillations II%1, Annals of Mathematics Study No. 29, Princeton University,
pp. 75-79.
%3McCarthy, John (1953)%1: "An Everywhere Continuous Nowhere Differentiable
Function," %2American Mathematical Monthly%1, December 1953, p. 709.
%3McCarthy, John (1954)%1: "A Nuclear Reactor for Rockets" %2Jet Propulsion%1,
January 1954.
%3McCarthy, John (1955)%1: "The Stability of Invariant Manifolds" Applied
Mathematics Laboratory Technical Report No. 36, Stanford University, 25
pp.
%3McCarthy, John (1956)%1: "The Inversion of Functions Defined by Turing
Machines," in %2Automata Studies, Annals of Mathematical Study No. 34,%1
Princeton, pp. 177-181.
%3McCarthy, John (1956)%1: "Aggregation in the Open Leontief Model,"
in Progress Report of Dartmouth Mathematics Project.
%3McCarthy, John (1956)%1: "Measures of the Value of Information,"
%2Proceedings of the National Academy of Sciences%1, September 1956.
%3McCarthy, John (1956)%1: Co-editor with Dr. Claude E. Shannon of %2Automata
Studies%1, Annals of Mathematics Study No. 34, Princeton University Press.
%3McCarthy, John (1960)%1: "Recursive Functions of Symbolic Expressions and their
Computation by Machine," %2Comm. ACM%1, April 1960.
%3McCarthy, John (1960)%1: "Programs with Common Sense," in Proceedings of the
Teddington Conference on the Mechanization of Thought Processes, Her Majesty's
Stationery Office, London.
common[e80,jmc]
%3McCarthy, John (with 12 others) (1960)%1 "ALGOL 60", %2Numerische
Mathematik%1, March 1960, also in %2Comm. ACM%1, May 1960 and Jan. 1963.
%3McCarthy, John (1961)%1: "A Basis for Mathematical Theory of Computation",
in %2Proc. Western Joint Computer Conf.%1, May 1961, pp. 225-238.
Later version in Braffort, P. and D. Hirschberg (eds.) %2Computer
Programming and Formal Systems%1, North-Holland Publishing Co. (1963).
%3McCarthy, John (1962)%1: "Time-Sharing Computing Systems," in %2Management
and the Computer of the Future%1, Martin Greenberger (ed.), MIT Press.
%3McCarthy, John (with Paul Abrahams, Daniel Edwards, Timothy
Hart and Michael Levin) (1962)%1:
%2LISP 1.5 Programmer's Manual%1, M.I.T. Press, Cambridge, Mass.
%3McCarthy, John (1962)%1: "Computer Programs for Checking Mathematical Proofs",
%2Amer. Math. Soc. Proc. of Symposia in Pure Math.%1, Vol. 5.
%3McCarthy, John (1963)%1: "Towards a Mathematical Theory of Computation",
in Proc. IFIP Congress 62, North-Holland, Amsterdam.
%3McCarthy, John (1963)%1: "A Basis for a Mathematical Theory of Computation",
in P. Braffort and D. Hirschberg (eds.), %2Computer Programming and
Formal Systems%1, North-Holland Publishing Co., Amsterdam, pp. 33-70.
%3McCarthy, John (1963)%1: "A Time-Sharing Debugging System for a Small
Computer", (with Boilen, Fredkin and Licklider), Proc. AFIPS 1963 Spring
Joint Computer Conf., Sparten Books, Detroit, pp. 51-57.
%3McCarthy, John (1963)%1: "The Linking Segment Subprogram Language and
Linking Loader Programming Languages", Comm. ACM, July 1963. (with F.
Corbato and M. Daggett),
%3McCarthy, John (1965)%1: "Problems in the Theory of Computation", in Proc.
IFIP Congress 65, Spartan, Washington, D.C..
%3McCarthy, John (1966)%1: "A Formal Description of a Subset of Algol",
%2Formal Language Description Languages for Computer Programming%1,
T.B. Steel, Jr. (ed.), North-Holland Publ. Co., Amsterdam, pp. 1-12.
%3McCarthy, John (1968%1: "Time-Sharing Computer Systems", in
%2Conversational Computers%1, William Orr (ed), Wiley Publishing Company.
%3McCarthy, John (1966)%1: "Information", %2Scientific American%1, Vol. 215.
%3McCarthy, John (1967)%1: "THOR - A Display Based Time-Sharing System",
(with D. Brian, G. Feldman, and John Allen)
%2AFIPS Conf. Proc.%1, Vol. 30, (FJCC) Thompson, Washington, D.C..
%3McCarthy, John (1967)%1: "Computer Control of a Hand and Eye", in %2Proc.
Third All-Union Conference on Automatic Control (Technical Cybernetics)%1,
Nauka, Moscow, (Russian).
%3McCarthy, John (1968)%1: "Programs with Common Sense," in M. Minsky (ed.),
%2Semantic Information Processing%1, M.I.T. Press, Cambridge, Mass.
%3McCarthy, John (1968)%1: "A Computer with Hands, Eyes, and Ears,"
(with L. Earnest, D. Reddy, P. Vicens)
%2Proc. AFIPS Conf.%1 (FJCC).
%3McCarthy, John and P.J. Hayes (1969)%1: "Some Philosophical Problems from
the Standpoint of Artificial Intelligence", in D. Michie (ed), %2Machine
Intelligence 4%1, American Elsevier, New York, NY.
phil[ess,jmc] with slight modifications
%3McCarthy, John (1972)%1: "The Home Information Terminal," Man and Computer,
in Proceedings International Conference, Bordeaux 1970, S. Karger, N.Y.
%3McCarthy, John (1973)%1: "Mechanical Servants for Mankind," in %2Britannica
Yearbook of Science and the Future%1.
%3McCarthy, John (1974)%1:
Book Review: "Artificial Intelligence: A General Survey" by Sir James
Lighthill, in %2Artificial Intelligence%1, Vol. 5, No. 3.
%3McCarthy, John (1974)%1: "Modeling Our Minds" in %2Science Year 1975, The
World Book Science Annual%1, Field Enterprises Educational Corporation,
Chicago, ILL.
%3McCarthy, John (1976)%1: "The Home Information Terminal," invited presentation,
AAAS Annual Meeting, Feb. 18-24, 1976, Boston.
%3McCarthy, John (1976)%1: "An Unreasonable Book," a review of %2Computer
Power and Human Reason%1, by Joseph Weizenbaum (W.H. Freeman and Co., San
Francisco, 1976) in %2SIGART Newsletter 58%1, June 1976, also in %2Creative
Computing%1, Chestnut Hill, Massachusetts, 1976 and in "Three Reviews of Joseph
Weizenbaum's %2Computer Power and Human Reason%1", (with Bruce
Buchanan and Joshua
Lederberg), Stanford Artificial Intelligence Laboratory Memo 291, Computer
Science Department, Stanford, CA.
%3McCarthy, John (1977)%1:
Review: %2Computer Power and Human Reason%1, by Joseph Weizenbaum (W.H.
Freeman and Co., San Francisco, 1976) in %2Physics Today%1.
%3McCarthy, John (1977)%1:
"The Home Information Terminal" %2Grolier Encyclopedia%1.
%3McCarthy, John (1977)%1:
"On The Model Theory of Knowledge" (with M. Sato, S. Igarashi, and
T. Hayashi), %2Proceedings of the Fifth International Joint Conference
on Artificial Intelligence%1, M.I.T., Cambridge, Mass.
%3McCarthy, John (1977)%1:
"Another SAMEFRINGE", in %2SIGART Newsletter%1 No. 61, February 1977.
samefr[f76,jmc]
%3McCarthy, John (1977)%1:
"History of LISP", in Proceedings of the ACM Conference on the
History of Programming Languages, Los Angeles.
lisp[f77,jmc]
%3McCarthy, John (1977)%1:
"Epistemological Problems of Artificial Intelligence", %2Proceedings
of the Fifth International Joint Conference on Artificial
Intelligence%1, M.I.T., Cambridge, Mass.
ijcai.c[e77,jmc]
%3McCarthy, John (1979)%1:
"Ascribing Mental Qualities to Machines" in %2Philosophical Perspectives
in Artificial Intelligence%1, Ringle, Martin (ed.), Harvester Press, July 1979.
.<<aim 326, MENTAL[F76,JMC]>>
%3McCarthy, John (1979)%1:
"First Order Theories of Individual Concepts and Propositions",
in Michie, Donald (ed.) %2Machine Intelligence 9%1, (University of
Edinburgh Press, Edinburgh).
.<<aim 325,concep[e76,jmc]>>
*%3Cartwright, Robert and John McCarthy (1979)%1:
"Recursive Programs as Functions in a First Order Theory",
in %2Proceedings of the International Conference on Mathematical Studies of
Information Processing%1, Kyoto, Japan.
.<<aim 324, FIRST.NEW[W77,JMC]>>
%3McCarthy, John (1980)%1:
"Circumscription - A Form of Non-Monotonic Reasoning", %2Artificial
Intelligence%1, Volume 13, Numbers 1,2, April.
.<<aim 334, circum.new[s79,jmc]>>
%3McCarthy, John and Carolyn Talcott (1980)%1: %2LISP - Programming and
Proving%1, course notes, Stanford University. (to be published as a book).
.<<The references in this bibliography (BIOJMC[1,JMC]) should be in a
.uniform style, because I often copy them to papers. The last few are
.correct. The publication in italics and first names spelled out.
.>>
%3McCarthy, John (1982)%1: "Common Business Communication Language", in
%2Textverarbeitung und B%B:%*urosysteme%1, Albert Endres and J%B:%*urgen Reetz, eds.
R. Oldenbourg Verlag, Munich and Vienna 1982.
cbcl[f75,jmc]
%3McCarthy, John (1982)%1: %2Coloring Maps and the Kowalski Doctrine%1,
Report No. STAN-CS-82-903, Computer Science Department, Stanford University,
Stanford, CA 94305.
maps[e81,jmc]
%3McCarthy, John (1983)%1: "AI Needs more Emphasis on Basic Research", %2AI
Magazine%1, Volume 4, Number 4, Winter 1983.
presid.1[f83,jmc]
%3McCarthy, John (1983)%1: "Some Expert Systems Need Common Sense", paper
presented at New York Academy of Sciences Symposium.
common[e83,jmc]
%3McCarthy, John (1983)%1: "The Little Thoughts of Thinking Machines",
%2Psychology Today%1, Volume 17, Number 12, December 1983.
psycho.4[e83,jmc]
%3McCarthy, John (1984)%1:
"Applications of Circumscription to Formalizing Common Sense Knowledge".
This was distributed at the 1984 AAAI
conference on non-monotonic reasoning, which will not have a proceedings
and is being submitted for publication to %2Artificial Intelligence%1.
circum.tex[f83,jmc]
∂11-Mar-85 1121 JMC re: employment with Stanford
To: VAL
[In reply to message rcvd 11-Mar-85 10:03-PT.]
Yes, I am very pleased with how things are going. Therefore, it is a firm
offer of full time employment at your prorated salary for the summer and
half time for the next academic year.
∂11-Mar-85 1123 JMC offer to Vladimir Lifschitz
To: bscott@SU-SCORE.ARPA, RA@SU-AI.ARPA, les-here@SU-AI.ARPA
CC: VAL@SU-AI.ARPA
I have offered him full time work this summer and half time next year
with pay according to his San Jose State salary.
∂11-Mar-85 1245 Mailer failed mail returned
To: JMC
In processing the following command:
MAIL/su
The command was aborted because these Host Name(s) are Unknown:
CMU-CC-TF
------- Begin undelivered message: -------
∂11-Mar-85 1245 JMC Bristol
I expect to arrive on AF04 at 5:25, Thursday Mar 21. Please make Bristol
reservations thru Sunday night. I will be alone this time. I trust
finances are disentangled.
------- End undelivered message -------
∂11-Mar-85 1320 JMC re: Dan Resnick
To: Raj.Reddy@CMU-CS-A.ARPA
[In reply to message sent 11 Mar 85 1607 EST.]
The profusion of addresses in that message makes it quite unclear to me
how to reply to him via ARPAnet. I'll consult a local expert to
see how one forwards thru CMU.
∂11-Mar-85 1351 JMC re: Some expert systems need common sense
To: RA
[In reply to message rcvd 11-Mar-85 13:42-PT.]
All my papers are listed in the last page of the file biojmc[1,jmc].
The ones Sarah has put into TEX are in the same directories with the
extension .TEX. This particular paper is COMMON.TEX[E83,JMC]. You
need to TEX it. Once you have done so check whether it can be
printed on ESP, which now makes prettier output than the DOVER.
∂11-Mar-85 1353 JMC
To: SMC
common.tex[e83,jmc] won't tex. Please check these things out.
∂11-Mar-85 1353 JMC losing
To: SMC
Half the time when I try to TEX and print one of the things you have
worked on for the first time it doesn't work. No doubt they all worked
once, but you make mistakes when you transfer them to my areas or something.
Please make sure they all work. I don't like having to track you down
to fix such trivia.
∂11-Mar-85 1356 JMC
To: RA
The tex version doesn't work. Use the pub version COMMON[E83,JMC] for now.
∂12-Mar-85 1203 JMC Bristol
To: "DR0Q@CMU-CC-TF"@CMU-CS-C.ARPA
I expect to arrive on AF04 at 5:25, Thursday Mar 21. Please make Bristol
reservations thru Sunday night. I will be alone this time. I trust
my pay for last year is disentangled.
∂12-Mar-85 1311 JMC
To: RA
Please refer the Chinese professor to Terry Winograd.
∂12-Mar-85 1450 JMC re: MYCIN
To: RA
[In reply to message rcvd 12-Mar-85 13:52-PT.]
Prof. Shortliffe in the Medical School.
∂12-Mar-85 1453 JMC re: AAAI conference
To: RA
[In reply to message rcvd 12-Mar-85 14:31-PT.]
People with questions about AAAI conferences should call AAAI in
Menlo Park. I haven't heard about this one, so probably not.
∂12-Mar-85 1501 JMC re: Queue-based multi-processing lisp paper
To: RA
[In reply to message rcvd 12-Mar-85 14:57-PT.]
Ask RPG.
∂12-Mar-85 1507 JMC reply to message
To: RA
[In reply to message rcvd 12-Mar-85 15:02-PT.]
April 3 is ok.
topic: Some expert systems need common sense.
Actually I have a vague memory that I actually agreed to talk about
something else, but I don't remember what it was. However, if they
don't remember either, this will do.
∂13-Mar-85 0904 JMC
To: SMC
Precision Engravers have the tray they engraved for you.
∂13-Mar-85 2144 JMC re: AAAI-86
To: RPG
[In reply to message rcvd 13-Mar-85 21:40-PT.]
I don't remember whether it was determined, though I think it was.
Claudia Mazzetti at the AAAI office, AAAI-OFFICE@SUMEX will know
for sure.
∂14-Mar-85 0909 JMC
To: CLT
J'ai nagg'e.
∂14-Mar-85 1224 JMC re: lisp birthday?
To: reid@SU-GLACIER.ARPA
[In reply to message sent Thu, 14 Mar 85 11:20:48 pst.]
No, I don't remember what that particular date would mean.
∂14-Mar-85 1232 JMC re: Prospective Student Visit
To: LAMPING@SU-SCORE.ARPA
[In reply to message sent Thu 14 Mar 85 10:59:03-PST.]
I will be in France on the 21st. I will probably be back by Monday.
∂14-Mar-85 1819 JMC re: PhD visit
To: THEODOROU@SU-SCORE.ARPA
[In reply to message sent Thu 14 Mar 85 15:39:03-PST.]
I'm very sorry, but while I will probably be back at Stanford on Monday
the 25th, I don't want to make an appointment. Since I'm going to Europe,
which is a long way, I want to be able to stay a little longer if this
seems like the right thing to do.
∂14-Mar-85 1846 JMC
To: RWW
RENEW[S78,JMC] 06-Jul-78 Proposal to renew Dialnet project
BELLNE.PRO[F75,JMC] 23-Sep-75 Early version of Dialnet proposal
∂15-Mar-85 2344 JMC re: Australian minister of science
To: RA
[In reply to message rcvd 15-Mar-85 14:31-PT.]
Either day is convenient, and either Stanford or San Francisco is
ok, but perhaps he'd like to see our facilities.
∂16-Mar-85 1356 JMC re: Two Recommendations from the Conference Committee
To: John.McDermott@CMU-CS-A.ARPA
[In reply to message sent 16 Mar 85 1626 EST.]
Have a quality day.
∂16-Mar-85 1531 JMC re: Two Recommendations from the Conference Committee
To: DAVIS%MIT-OZ@MIT-MC.ARPA
[In reply to message sent Sat 16 Mar 85 17:52:07-EST.]
Have a quality day.
∂16-Mar-85 2150 JMC my mail
To: RA
Please try to remember to retrieve and open my mail. I know I sometimes
pick it up myself when I happen to pass the mail boxes, but this is a bad
habit of mine. However, when I am out of town for one or several days,
you can surely beat me to picking it up. Keep the junk mail separate.
∂16-Mar-85 2208 JMC proposal
To: les-here
You should have (maybe you did) ask Squires about going ahead with
the formal proposal. It doesn't appear from your message that you
got any more information about how rapidly IPT is prepared to act.
I want to think about whether we want anything more definite from
Fateman, but let's presume that it will be a subcontract from
Stanford. I guess I (we) should talk with him to be sure there
is still a meeting of minds.
∂16-Mar-85 2313 JMC Fateman
To: LES, CLT
I talked with him, and he will come down the 28th, Thursday at 10am.
Les, you should call him next week about any contract matters.
∂17-Mar-85 0019 JMC re: Industrial Lecturer
To: gnelson@DECWRL.ARPA
[In reply to message sent Sat, 16 Mar 85 23:25:36 pst.]
There are three lecture courses each year, one each quarter.
The applications are due in January for the following academic year.
The lead time is so that course descriptions can be included in
the catalog. The lecturers for 1985-86 have already been chosen -
John Williams from IBM San Jose on functional programming, Fernando
Pereira from SRI on logic programming, and Dan Bobrow, Mark Stefik
and others from Xerox PARC on AI languages. I would be glad to have
your application next winter. I would need a course description,
suitable for inclusion in the catalog, 10 lines is about right,
and a vita. Lecturers are presently paid $3,000 or 1/16th of
their annual salary, whichever is lower.
∂17-Mar-85 0028 JMC CSD Faculty/Staff phone list
To: reges@SU-SCORE.ARPA
I am guessing that you are responsible for it. It should say who is
so that corrections can be proposed. The next time it comes out I
would like to include (Jussi Ketonen, JK@SU-AI, Senior Research
Associate on leave, phone at Lucid), (Richard P. Gabriel, RPG@SU-AI,
Consulting Associate Professor (or is it Assistant?), phone at Lucid),
(Vladimir Lifschitz, VAL@SU-AI Research Associate (I think that's
the title) 7-4202), (Lester Earnest, LES@SU-AI, Qlambda project, no
title yet), and the Industrial Lecturers for the current year.
∂17-Mar-85 0949 JMC re: CSD Faculty/Staff phone list
To: REGES@SU-SCORE.ARPA
[In reply to message sent Sun 17 Mar 85 03:46:08-PST.]
Thanks for the information, Stuart. However, receptionists come and go,
so their state of expertise is a saw-tooth function. Let me suggest
that you create a user RECEPTIONIST@SCORE and that documents note
that corrections and requests of certain kinds be mailed to her
or it.
∂17-Mar-85 1122 JMC re: Student Prospect
To: NILSSON@SU-SCORE.ARPA
[In reply to message sent Sun 17 Mar 85 11:19:31-PST.]
As I told Theodorou, I will probably be back by then but can't guarantee it.
If I am back Sunday, I'll MAIL him a message.
∂18-Mar-85 0006 JMC E subjob improvement
To: ME
Would it be possible to arrange that αβ= causes a subjob to exist if
there isn't one already? My EINIT.CMD creates one, but this makes
each entry into E take more time. It would be most convenient if this
job were created in LATTACH mode, but others may feel differently
about that.
∂18-Mar-85 1120 JMC
To: JMC
26 76 58
∂18-Mar-85 1359 JMC re: Prof.Moto-oka / ICOT visitors
To: SG
[In reply to message rcvd 18-Mar-85 12:16-PT.]
Yes, I know Moto-Oka. We were at a symposium in Marseilles together. If you
see him again, give him my regards. I will be here this afternoon and
will be glad to see the researchers from ICOT if you think they and I
have interests in common.
∂18-Mar-85 1421 JMC support of conference
To: AAAI-OFFICE@SUMEX-AIM.ARPA
I have agreed to support the New Mexico State University conference
on foundations and methodology of AI to the tune of $5,000. None of
the money is to be used for honoraria, and Yorick Wilks has agreed
to that.
∂18-Mar-85 2251 JMC
To: nilsson@SU-SCORE.ARPA
Shapiro, Ehud <Udi%Wisdom.bitnet@WISCVM.ARPA>
∂18-Mar-85 2312 JMC re: Stanford Computer Scientist sues DOD! (from SAIL's BBOARD)
To: OTHER-SU-BBOARDS@SU-AI.ARPA
jmc - Clifford Johnson supposes he is reducing the risk of nuclear war
by his suit. This will not be true if the main danger of war is that
the U.S. will appear irresolute and intimidatable. His suit, regardless
of its outcome, contributes to this possibility.
Naturally, the higher the level of court that takes him seriously, the
greater the damage, and the more likely that the Government will be
impelled to gestures of determination. Fortunately, I don't think
the suit will get very far, for reasons advanced by others in this
page, the fact that he is attacking capability not policy, and the
tenuous identification of retaliatory military action with the act
of declaring war.
Some aspects of deterrence are treatable by game theory, and from
that point of view, an advance irrevocable decision to retaliate
has advantages. Imagine a reliable device that will initiate
retaliation when an attack occurs without action by the President.
The possibility of intimidating the President by an attack that
does great damage and threatens further damage if there is retaliation
is then eliminated. An extreme of this is the game theoretic slogan,
"In this dangerous situation one of us has to behave rationally, and
since it isn't going to be me, it must be you".
However, game theory is not the whole story. Neither the U. S.
nor the Soviet Union is well described as optimizing a single variable.
The danger of Soviet attack, which I regard as real but very remote
under present circumstances, may develop as a result of some future
power struggle in that country, wherein some leader gains power
under the slogan that the cowardly capitalists will cave in if
only sufficiently pressed. The old bosses were much to conservative
to take this point of view, and the new boss certainly shows no
signs of it. He seems to be the old men's young man.
∂19-Mar-85 1320 JMC BBOARD
To: GIO@SU-AI.ARPA
If you read BBOARD on a computer with a good system, namely SAIL,
you can avoid the most of the flamage, if you want to, because
various helpful people concentrate it into a single page for each
subject.
∂19-Mar-85 1422 JMC academic senate
To: nilsson@SU-SCORE.ARPA
Rutie says you asked if I would like to serve again as "department rep.".
There isn't exactly such a thing, because the constituencies for election
are larger than departments. However, I am available for re-election
for one more two year term and don't mind your making this known.
∂19-Mar-85 1755 JMC
To: avg@SU-AIMVAX.ARPA
jmc - I think Johnson is protesting government actions which are either
correct or at least reasonable and within government discretion.
Perhap you agree that his action is a protest rather than an attempt to
stop illegal activities as his suit claims. Legally it seems
frivolous to me, even though a possibly frivolous and power-grabbing judge
thought not. As such it corrupts the court system. While the Soviet
establishment cannot estimate the effect of all our political noise,
Mr. Arbatov's Institute of the U.S.A. and Canada can and does provide
estimates that guide the leaders in determining what they can get away
with. They have correctly determined that protest in the West is
almost unaffected by the level of their own armament. For example,
only a little of the Western discussion of Star Wars has concerned
the Soviet efforts and their lead in this area, and NONE of the BBOARD
discussion has concerned Russian systems for initiating nuclear war.
The Soviet system has produced one paranoid leader, Stalin, responsible
for the deaths of millions of Soviet citizens and hundreds of thousands,
if not millions, of foreign citizens. I don't understand why you
consider a theoretical notion of what their system is like to its
actual history. In my opinion, Soviet opinion is in a mood for
strong leadership, a master. Khozayin is the Russian word often
heard these days. This opinion will permit Gorbachev to concentrate
great power in his hands if he is so inclined. If he subsequently
starts killing people and pursuing a more aggressive foreign policy,
there may be nothing to stop him. What the "experts" no of his
inclinations is speculation, and much of it is pure wishful thinking.
Finally, I don't understand why you an interpret my previous remarks
as an attempt to silence Johnson except by trying to refute some of
his arguments.
∂19-Mar-85 1756 JMC re: Stanford Computer Scientist sues DOD! (from SAIL's BBOARD)
To: OTHER-SU-BBOARDS@SU-AI.ARPA
jmc - I think Johnson is protesting government actions which are either
correct or at least reasonable and within government discretion.
Perhap you agree that his action is a protest rather than an attempt to
stop illegal activities as his suit claims. Legally it seems
frivolous to me, even though a possibly frivolous and power-grabbing judge
thought not. As such it corrupts the court system. While the Soviet
establishment cannot estimate the effect of all our political noise,
Mr. Arbatov's Institute of the U.S.A. and Canada can and does provide
estimates that guide the leaders in determining what they can get away
with. They have correctly determined that protest in the West is
almost unaffected by the level of their own armament. For example,
only a little of the Western discussion of Star Wars has concerned
the Soviet efforts and their lead in this area, and NONE of the BBOARD
discussion has concerned Russian systems for initiating nuclear war.
The Soviet system has produced one paranoid leader, Stalin, responsible
for the deaths of millions of Soviet citizens and hundreds of thousands,
if not millions, of foreign citizens. I don't understand why you
consider a theoretical notion of what their system is like to its
actual history. In my opinion, Soviet opinion is in a mood for
strong leadership, a master. Khozayin is the Russian word often
heard these days. This opinion will permit Gorbachev to concentrate
great power in his hands if he is so inclined. If he subsequently
starts killing people and pursuing a more aggressive foreign policy,
there may be nothing to stop him. What the "experts" no of his
inclinations is speculation, and much of it is pure wishful thinking.
Finally, I don't understand why you an interpret my previous remarks
as an attempt to silence Johnson except by trying to refute some of
his arguments.
∂19-Mar-85 1838 JMC re: Name contest
To: JJW
I suggest Dinny, Alley Oop's dinosaur.
∂19-Mar-85 2047 JMC re: Silencing Johnson?
To: avg@SU-AIMVAX.ARPA
[In reply to message sent Tue, 19 Mar 85 18:53:30 pst.]
Certainly what I said is open to the interpretation that he should stop,
and I think he should. What I didn't say is that he should be stopped,
and I don't think that. Your "Even if a protest is ill-conceived, the
response should be to rebut it, not to silence it." suggests that I
suggested that he should be stopped. As to whether the USSR will attack,
I consider the probability low. I wouldn't even give even money that they
would take over Western Europe if it were undefended. However, there is
an enormous uncertainty, and I think their political future is far more
mysterious than our own in spite of its recent immobility. I agree about
putting the missiles under European control, but notice that many people
would have sentimental objections to putting missiles under German
control. As I understand it, the C in LOWC stands for capability. I
cannot work up fear of capability so long as the decision to make the
system automatic can be made later. The decision to implement an LOW
system would be made only under rather desperate circumstances. Of
course, people with a profound distrust of our political system or a very
strong partisan dislike of a particular administration can always bring
themselves to believe that capability of doing something they think is a
bad idea is likely to be implemented.
∂19-Mar-85 2325 JMC hotel
To: CLT, RA
Hotel Napoleon
40, avenue de Friedland
75008 Paris
Tel: 766 0202
Tx: 640 609
∂20-Mar-85 1048 JMC
To: CLT
N'oublie pas payer Zella.
∂20-Mar-85 1057 JMC re: Emycin
To: AI.PETRIE@MCC.ARPA
[In reply to message sent Wed 20 Mar 85 09:37:15-CST.]
Thanks for the EMYCIN note. It happens to be very relevant to something
I am currently thinking about.
∂20-Mar-85 1059 JMC
To: woody@MCC.ARPA
How about the week of April 8, any days?
∂20-Mar-85 1100 JMC (→17111 24-Mar-85)
To: "#___JMC.PLN[2,2]"
I will be in France until at least Sunday, March 23.
∂24-Mar-85 0001 JMC Expired plan
To: JMC
Your plan has just expired. You might want to make a new one.
Here is the text of the old plan:
I will be in France until at least Sunday, March 23.
∂24-Mar-85 2354 JMC re: visit by Barry Jones (Australia)
To: RA
[In reply to message rcvd 20-Mar-85 11:44-PT.]
Barry Jones visit time ok.
∂24-Mar-85 2359 JMC re: Les Earnest Payment
To: BSCOTT@SU-SCORE.ARPA
[In reply to message sent Sat 23 Mar 85 15:02:16-PST.]
Seems about right to me.
∂25-Mar-85 0944 JMC re: Visiting prospective student
To: SCHAFFER@SU-SCORE.ARPA
[In reply to message sent Fri 22 Mar 85 09:37:03-PST.]
I propose 11am for Nakul Sariya.
∂25-Mar-85 1647 JMC re: Orals
To: YOM
[In reply to message rcvd 25-Mar-85 15:38-PT.]
The date seems ok, but what have you in the way of a thesis proposal?
∂25-Mar-85 1647 JMC re: change in my schedule
To: RA
[In reply to message rcvd 25-Mar-85 16:29-PT.]
The proposed change is not ok with me.
∂25-Mar-85 1743 JMC Halcion
To: shortliffe@SUMEX-AIM.ARPA
It seems to have worked well. I would like a prescription for it.
∂25-Mar-85 1830 JMC re: interp[1,CWR]
To: RESTIVO@SU-SCORE.ARPA
[In reply to message sent Mon 25 Mar 85 18:28:24-PST.]
I have some vague plans of trying it out, but I've been away and haven't
got around to it. Many thanks for putting it in the computer.
∂25-Mar-85 2054 JMC
To: restivo@SU-SCORE.ARPA
If you have any ideas about introspective Prolog come by.
∂25-Mar-85 2338 JMC
To: YOM
Who is your thesis adviser?
∂26-Mar-85 1113 JMC re: Inferior implication
To: VAL
[In reply to message rcvd 26-Mar-85 11:01-PT.]
I'm not sure to what extent their paper is revised from the one I
saw. However, there were two additional points of difference, it
seemed to me. First, their reasoning was entirely semantic; they
didn't have an inference rule. Second, their inference works
even when there isn't a minimal model. I proposed to them a
syntactic inference rule that follows their semantics in the
same way that circumscription characterizes the minimal model.
I don't know whether they included it. I look forward to your comments
on their paper.
∂26-Mar-85 1156 JMC re: Inferior implication
To: VAL
[In reply to message rcvd 26-Mar-85 11:38-PT.]
I don't think that A infimp B can be reduced to A' ⊃ B, because the A'
which corresponds to circumscription, is consistent only when a minimal
model exists. A infimp B corresponds to saying that B is true in all
sufficiently small models of A and doesn't require the existence of
a minimal model.
∂26-Mar-85 1403 JMC re: text for AI course
To: VAL
[In reply to message rcvd 26-Mar-85 12:28-PT.]
There isn't anything enormously good, but you might try Elaine Rich's
Artificial Intelligence published by McGraw-Hill.
∂26-Mar-85 1405 JMC re: text for AI course
To: VAL
[In reply to message rcvd 26-Mar-85 12:28-PT.]
Second thought. Since your interests run to logic, you might consider
one of Nilsson's books. In particular, the new one he is writing
with Mike Genesereth might be available by then in preliminary form.
You should ask him.
∂26-Mar-85 1409 JMC
To: genesereth@SUMEX-AIM.ARPA
Please phone me asap.
∂26-Mar-85 1424 JMC msg
To: genesereth@SUMEX-AIM.ARPA
He went home and I left messages.
∂26-Mar-85 1139 TULEY@SU-SCORE.ARPA msg
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 26 Mar 85 11:39:38 PST
Date: Tue 26 Mar 85 11:36:34-PST
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: msg
To: jmc@SU-AI.ARPA
Hello,
Michael Rabins, of Detroit - Michigan, called about having you serve on a
committee for the Nat'l Science Foundation. He needs to settle this before
next week so is very anxious to talk to you.
home: 313-851-5530 or office: 313-577-3843.
Kim
-------
∂26-Mar-85 1922 JMC for David Chudnovsky
To: RA
Please pick up from the Dover spooled output of bboard under my name and
send it to David C.
∂27-Mar-85 1144 JMC prioritized c.
To: VAL
I have only a limited amount of material for today, so I hope you will
be able to continue.
∂27-Mar-85 1312 JMC
To: LES, RTC
∂27-Mar-85 1220 RTC EBOS
What is happening with regard to the editor based operating
stuff.
Ross
Can the three of us get together about EBOS tomorrow afternoon? I
prefer 1pm, because it won't be too late for a phone call to Mike
Blasgen at IBM Yorktown.
∂27-Mar-85 1316 JMC Bossu and Siegel
To: VAL
Perhaps the interesting question about their paper is whether their
methods would work if not everything were being minimized, i.e. some
predicates were variable and some parameters.
∂27-Mar-85 1533 JMC
To: grosof@SUMEX-AIM.ARPA
mcderm[s84,jmc] McDermott example? done by circumscription
∂27-Mar-85 1537 JMC
To: LES, RTC
∂27-Mar-85 1535 RTC EBOS
To: JMC, LES
I can't make it tomorrow. Friday would be fine, up till about 3pm.
Ross
How about Friday at 1pm then? - jmc
∂27-Mar-85 2138 JMC
To: RA
newrep.1. Also please put numerical extensions on letter files.
∂28-Mar-85 0101 JMC diagnosis as circumscription
To: grosof@SU-SCORE.ARPA
Your idea strikes me as plausible, but it seems like wishful
thinking to refer to what you have as a draft. You need to do
an example, even if a small one, rather than imagine extensions
at this time.
∂28-Mar-85 1156 JMC re: Congress in Spain
To: RA
[In reply to message rcvd 28-Mar-85 09:36-PT.]
Please tell them that I don't have time.
∂28-Mar-85 2021 JMC
To: CLT
Would you like the Chagall obituary by John Russell in a file?
∂28-Mar-85 2311 JMC
To: CLT
chagal.ns[w85,jmc]
∂29-Mar-85 1303 JMC
To: CLT
Susie proposes Wednesday.
∂29-Mar-85 1334 JMC
To: LES
This person is Michael Blasgen 914 945-3478.
∂29-Mar-85 1427 JMC add jmc@su-ai to nail
To: mailer@SU-AIMVAX.ARPA
Is this right?
∂29-Mar-85 1433 JMC add
To: mailer@SU-AIMVAX.ARPA
add jmc@su-ai to nail
∂29-Mar-85 1517 JMC getting on nail list
To: mail-wizards@SU-AIMVAX.ARPA
I tried twice according to various interpretations of Jeff Ullman's
bboard message, and then he put me on the list. However, we now
suspect that I may be on more than once, perhaps both as jmc@su-ai
and jmc-lists@su-ai. Only the second is correct. Can you fix this
and perhaps enlighten me about how to get on and off such mailing
lists?
∂29-Mar-85 1603 JMC test
To: JMC
∂29-Mar-85 1734 JMC fascist computer programmers
To: burgess@SU-AIMVAX.ARPA
Bill Nowicki, or whoever, has avoided the hypothetical possibility that
someone would mischievously put someonelse on a mailing list at the cost
of making legitimate actions, which he didn't think of, impossible. It's
an excellent example of the regulatory ethic. SAIL would at most ask,
"Do you really want to do that?"
∂29-Mar-85 2221 JMC re: Name contest (from SAIL's BBOARD)
To: OTHER-SU-BBOARDS@SU-AI.ARPA
jmc - We could name the computers after the children of students and
faculty.
∂30-Mar-85 1834 JMC re: Playboy and Coercion (from SAIL's BBOARD)
To: OTHER-SU-BBOARDS@SU-AI.ARPA
jmc - Lowry is right in criticizing Crispin's use of the term
"neo-fascist" and "totalitarian". Crispin is also wrong to use
the term "cretin" for general abuse, even though it has gone out
of fashion as referring to a certain level of mental retardation.
For what they are H. L. Mencken used the term "wowser", and the
wowsers of his day promoted prohibition and literary censorship.
There seems to be a natural law of conservation of wowserism -
if it's not about one thing it's about another. Lowry is probably
mistaken about it being permissible to try to persuade hotels to
refuse accomodation. That is certainly contrary to the California
Civil Rights Act, passed, I think, in the 1890s. Getting hotels
and restaurants to refuse accomodation to union organizers was a
practice that gradually became illegal, and it seems to me that
Playboy photographers are also protected. The point is that
establishments that serve the public are not allowed to deny
service capriciously. Of course, Jerry Brown's judges may find
a reason why the law wouldn't apply.
∂30-Mar-85 1924 JMC re: EURISKO
To: ALTENBERG@SUMEX-AIM.ARPA
[In reply to message sent Sat 30 Mar 85 18:18:45-PST.]
Why not address your inquiry to LENAT@MCC rather than bothering all
the BBOARDs? If you didn't know where he is in Texas, you could have
inquired at the Computer Science Department.
∂31-Mar-85 0046 JMC repeat of earlier message
To: ai.woody@MCC.ARPA
How about Monday the 8th and Tuesday the 9th?
∂31-Mar-85 2133 JMC mailing list
To: aaai-office@SUMEX-AIM.ARPA
Let me suggest that you create a file at Sumex constituting the Executive
Committee mailing list and update it when required. The communications to
the Committee could be routed through the file. Such a file will let
people wishing to mail to the Committee avoid keeping individually a list
of members.
I would like to be on that files as JMC-LISTS@SU-AI, because that
will route mail coming to me by virtue of being on a list into a different
file than mail sent to me individually. Since I got 750 messages this
quarter, it is a convenience.
∂31-Mar-85 2145 JMC Subject: Hofstader on sexist language (from SAIL's BBOARD)
To: OTHER-SU-BBOARDS@SU-AI.ARPA
jmc - Sarcasm often makes adherents of one side of a controversy feel
better, but it rarely convinces opponents or even the undecided.
Thus it hasn't affected my negative view of attempts to purge the
English language.